A Física da Terminação

Open access

Sumário

Mostramos que, em virtude dos limites teóricos da computação, nem toda a ciência formulada com carácter preditivo pode ser simulada. Em particular, evidencia- se que a Fisica Clássica, nomeadamente a Físíca Newtoniana, padece deste mal, encerrando processos de Zenão.

Andréka, H., Nemeti , I., & Nemeti, P. (2009). General relativistic hypercomputing and foundation of mathematics. Natural Computing, 8(3), 499-516.

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.

Copeland, J. B. (1998). Super-Turing machines. Complexity, 4, 30-32.

Costa, J. (2012). Turing machines as clocks, rulers and randomizers. Boletim da Sociedade Portuguesa de Matematica(67), 121-153.

Davis, M. (2000). The Universal Computer, The Road from Leibniz to Turing. W. W. Norton and Company.

Fritz, W. B. (1996). The women of ENIAC. IEEE Annals of the History of Computing, 18(3), 13-28.

Geroch, R., & Hartle, James B. (1986). Computability and physical theories. Foundations of Physics, 16(6), 533-550.

Gerver, J. (1991). The existence of pseudo-collisions in the plane. Journal of Differential Equations(89), pp. 1-68.

Hogarth, M. (2004). Deciding Arithmetic Using SAD Computers. British Journal for the Philosophy of Science, 55(4), 681-691.

Penrose, R. (1989). The Emperor’s New Mind. Oxford University Press.

Shagrir, O. (2012). Supertasks do not increase computational power. Natural Computing, 11(1), 51-58.

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.

Smith, W. (2006). Church’s thesis meets the N-body problem. Applied Mathematics and Computation, 178(1), 154-183.

Turing, A. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230-265.

Turing, A. (1937). On computable numbers. Proceedings of the London Mathematical Society, 43, 544-546.

Turing, A., & Girard, J.-Y. (1991). La Machine de Turing. Sources du Savoir, Seuil.

Xia, Z. (1992). The existence of noncollision singularities in Newtonian systems. The Annals of Mathematics, Second Series, 135(3), 411-468.

Journal Information

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 75 75 14
PDF Downloads 17 17 2