The complexity of analog computation
Mathematics and Computers in Simulation
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Complexity and real computation
Complexity and real computation
Zeno machines and hypercomputation
Theoretical Computer Science
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science
An explicit solution to Post's Problem over the reals
Journal of Complexity
Programming Experimental Procedures for Newtonian Kinematic Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
ACM Transactions on Computational Logic (TOCL)
SIMPL systems, or: can we design cryptographic hardware without secret key information?
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
An explicit solution to post's problem over the reals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Towards electrical, integrated implementations of SIMPL systems
WISTP'10 Proceedings of the 4th IFIP WG 11.2 international conference on Information Security Theory and Practices: security and Privacy of Pervasive Systems and Smart Devices
SIMPL systems as a keyless cryptographic and security primitive
Cryptography and Security
Alan turing: the logical and physical basis of computing
Turing'04 Proceedings of the 2004 international conference on Alan Mathison Turing: a celebration of his life and achievements
The impact of models of a physical oracle on computational power
Mathematical Structures in Computer Science
| Hi-index | 0.01 |
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence suggests that this might be the case in the quantum world. But the question is of great interest even in the realm of classical physics. In this article, we observe that there is fundamental tension between the Extended Church--Turing Thesis and the existence of numerous seemingly intractable computational problems arising from classical physics. Efforts to resolve this incompatibility could both advance our knowledge of the theory of computation, as well as serve the needs of scientific computing.