Algorithmic information theory
Algorithmic information theory
Intelligence without representation
Artificial Intelligence
Elements of interaction: Turing award lecture
Communications of the ACM
The confluence of ideas in 1936
The universal Turing machine (2nd ed.)
Shadows of the Mind: A Search for the Missing Science of Consciousness
Shadows of the Mind: A Search for the Missing Science of Consciousness
Computation beyond turing machines
Communications of the ACM - Digital rights management
The computational complexity of some julia sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Intelligence Without Reason
Alan Turing: Life and Legacy of a Great Thinker
Alan Turing: Life and Legacy of a Great Thinker
Hyperbolic Julia Sets are Poly-Time Computable
Electronic Notes in Theoretical Computer Science (ENTCS)
A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
The Extended Turing Model as Contextual Tool
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
General relativistic hypercomputing and foundation of mathematics
Natural Computing: an international journal
Can general relativistic computers break the turing barrier?
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Mathematics, metaphysics and the multiverse
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Hi-index | 0.00 |
Ever since Alan Turing gave us a machine model of algorithmic computation, there have been questions about how widely it is applicable (some asked by Turing himself). Although the computer on our desk can be viewed in isolation as a Universal Turing Machine, there are many examples in nature of what looks like computation, but for which there is no well-understood model. In many areas, we have to come to terms with emergence not being clearly algorithmic. The positive side of this is the growth of new computational paradigms based on metaphors for natural phenomena, and the devising of very informative computer simulations got from copying nature. This talk is concerned with general questions such as: – Can natural computation, in its various forms, provide us with genuinely new ways of computing? – To what extent can natural processes be captured computationally? – Is there a universal model underlying these new paradigms?