-
Programming Paradigms, Turing Completeness and Computational Thinking
The notion of programming paradigms, with associated programming languag...
read it
-
FIFTH system for general-purpose connectionist computation
To date, work on formalizing connectionist computation in a way that is ...
read it
-
Syntax Evolution: Problems and Recursion
Why did only we humans evolve Turing completeness? Turing completeness i...
read it
-
Propositional satisfiability in declarative programming
Answer-set programming (ASP) paradigm is a way of using logic to solve s...
read it
-
Transpiling Programmable Computable Functions to Answer Set Programs
Programming Computable Functions (PCF) is a simplified programming langu...
read it
-
DynamicPPL: Stan-like Speed for Dynamic Probabilistic Models
We present the preliminary high-level design and features of DynamicPPL....
read it
Cinnamons: A Computation Model Underlying Control Network Programming
We give the easily recognizable name "cinnamon" and "cinnamon programming" to a new computation model intended to form a theoretical foundation for Control Network Programming (CNP). CNP has established itself as a programming paradigm combining declarative and imperative features, built-in search engine, powerful tools for search control that allow easy, intuitive, visual development of heuristic, nondeterministic, and randomized solutions. We define rigorously the syntax and semantics of the new model of computation, at the same time trying to keep clear the intuition behind and to include enough examples. The purposely simplified theoretical model is then compared to both WHILE-programs (thus demonstrating its Turing-completeness), and the "real" CNP. Finally, future research possibilities are mentioned that would eventually extend the cinnamon programming into the directions of nondeterminism, randomness, and fuzziness.
READ FULL TEXT
Comments
There are no comments yet.