Theoretical Computer Science
An introduction to functional programming
An introduction to functional programming
Handbook of logic in computer science (vol. 3): semantic structures
Handbook of logic in computer science (vol. 3): semantic structures
Why interaction is more powerful than algorithms
Communications of the ACM
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
The computer and the brain
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Turing machines, transition systems, and interaction
Information and Computation
The church-turing thesis: breaking the myth
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Hi-index | 0.00 |
This paper reviews and extends previous work on the domain-theoretic notion of Machine Development. It summarizes the concept of Developmental Computation and shows how Interactive Computation can be understood as a stepping stone in the pathway from Classical to Developmental Computation. A critical appraisal is given of Classical Computation, showing in which ways its shortcomings tend to restrict the possible evolution of real computers, and how Interactive and Developmental Computation overcome such shortcomings. The idea that Developmental Computation is more encompassing than Interactive Computation is stressed. A formal framework for Developmental Computation is sketched, and the current frontier of the work on Developmental Computation is briefly exposed.