Have a personal or library account? Click to login
A Física da Terminação Cover

References

  1. Andréka, H., Nemeti , I., & Nemeti, P. (2009). General relativistic hypercomputing and foundation of mathematics. Natural Computing, 8(3), 499-516.10.1007/s11047-009-9114-3
  2. Copeland, J. B. (1998). Even Turing machines can compute uncomputable functions. In C. Calude, Casti, John, & Dinneen, M. J. (Ed.), Unconventional Models of Computation, Lecture Notes in Computer Science (pp. 150-164). Springer.
  3. Copeland, J. B. (1998). Super-Turing machines. Complexity, 4, 30-32.10.1002/(SICI)1099-0526(199809/10)4:1<30::AID-CPLX9>3.0.CO;2-8
  4. Costa, J. (2012). Turing machines as clocks, rulers and randomizers. Boletim da Sociedade Portuguesa de Matematica(67), 121-153.
  5. Davis, M. (2000). The Universal Computer, The Road from Leibniz to Turing. W. W. Norton and Company.
  6. Fritz, W. B. (1996). The women of ENIAC. IEEE Annals of the History of Computing, 18(3), 13-28.10.1109/85.511940
  7. Geroch, R., & Hartle, James B. (1986). Computability and physical theories. Foundations of Physics, 16(6), 533-550.10.1007/BF01886519
  8. Gerver, J. (1991). The existence of pseudo-collisions in the plane. Journal of Differential Equations(89), pp. 1-68.
  9. Hogarth, M. (2004). Deciding Arithmetic Using SAD Computers. British Journal for the Philosophy of Science, 55(4), 681-691.10.1093/bjps/55.4.681
  10. Penrose, R. (1989). The Emperor’s New Mind. Oxford University Press.10.1093/oso/9780198519737.001.0001
  11. Shagrir, O. (2012). Supertasks do not increase computational power. Natural Computing, 11(1), 51-58.10.1007/s11047-011-9280-y
  12. Shannon, C. E. (1956). A universal Turing machine with two internal states. (C. E. Shannon, & J. McCarthy, Edits.) Annals of Mathematical Studies, 34, pp. 157-165.10.1515/9781400882618-007
  13. Smith, W. (2006). Church’s thesis meets the N-body problem. Applied Mathematics and Computation, 178(1), 154-183.10.1016/j.amc.2005.09.077
  14. Turing, A. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230-265.
  15. Turing, A. (1937). On computable numbers. Proceedings of the London Mathematical Society, 43, 544-546.
  16. Turing, A., & Girard, J.-Y. (1991). La Machine de Turing. Sources du Savoir, Seuil.
  17. Xia, Z. (1992). The existence of noncollision singularities in Newtonian systems. The Annals of Mathematics, Second Series, 135(3), 411-468.10.2307/2946572
Language: English
Page range: 14 - 60
Published on: Nov 8, 2016
Published by: Sciendo
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2016 José Félix Costa, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.