References

  1. Ämin Baumeler & Stefan Wolf (2018): Computational tameness of classical non-causal models. In: Proc. R. Soc. A 474. The Royal Society, pp. 20170698, doi:10.1098/rspa.2017.0698.
  2. Edward William Blakey (2010): A model-independent theory of computational complexity : from patience to precision and beyond. University of Oxford, UK. Available at http://ora.ox.ac.uk/objects/uuid:5db40e2c-4a22-470d-9283-3b59b99793dc.
  3. Lenore Blum, Mike Shub & Steve Smale (1989): On a theory of computation and complexity over the real numbers: NP -completeness, recursive functions and universal machines. Bulletin (New Series) of the American Mathematical Society 21(1), pp. 1–46, doi:10.1090/S0273-0979-1989-15750-9.
  4. Alan Cobham & Yehoshua Bar-Hillel (1969): The intrinsic computational difficulty of functions.
  5. S. Barry Cooper (2004): Computability theory. Chapman & Hall/CRC, Boca Raton, FL.
  6. David Deutsch (1985): Quantum theory, the Church-Turing principle and the universal quantum computer. In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 400. The Royal Society, pp. 97–117, doi:10.1098/rspa.1985.0070.
  7. Jack Edmonds (1965): Paths, trees, and flowers. Canadian Journal of mathematics 17(3), pp. 449–467, doi:10.4153/CJM-1965-045-4.
  8. Richard L Epstein (2011): Classical mathematical logic: the semantic foundations of logic. Princeton University Press.
  9. Yuri Gurevich (2000): Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1), pp. 77–111, doi:10.1145/343369.343384.
  10. Joel David Hamkins & Andy Lewis (2000): Infinite time Turing machines. The Journal of Symbolic Logic 65(2), pp. 567–604, doi:10.2307/2586556.
  11. Clare Horsman, Susan Stepney, Rob C Wagner & Viv Kendon (2014): When does a physical system compute?. In: Proc. R. Soc. A 470. The Royal Society, pp. 20140182, doi:10.1098/rspa.2014.0182.
  12. Richard Kaye (1991): Models of Peano arithmetic. Oxford Logic Guides 15. The Clarendon Press, Oxford University Press, New York. Oxford Science Publications.
  13. Michael A. Nielsen & Isaac L. Chuang (2000): Quantum computation and quantum information. Cambridge University Press, Cambridge, doi:10.1017/CBO9780511976667.
  14. Nader Vakil (2011): Real analysis through modern infinitesimals. Cambridge University Press, doi:10.1017/CBO9780511740305.
  15. Anastasios Vergis, Kenneth Steiglitz & Bradley Dickinson (1986): The complexity of analog computation. Mathematics and computers in simulation 28(2), pp. 91–113, doi:10.1016/0378-4754(86)90105-9.
  16. Richard Whyman (2018): Physical Computation and First-Order Logic. In: Machines, Computations, and Universality - 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, doi:10.1007/978-3-319-92402-1.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org