How to build a hypercomputer

Applied Mathematics and Computation

Volumn 215, Issue 4, 2009, Pages 1361-1367

  Da Costa, N C A ^a   Doria, F A ^a  

^a Production Engineering Program   (Brazil)

Author keywords

Hypercomputation; Hypercomputer; Turing machines

Indexed keywords

ENGINEERING PROBLEMS; HALTING PROBLEMS; HYPERCOMPUTATION;

MACHINERY;

TURING MACHINES;

EID: 77955309791     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.04.049     Document Type: Conference Paper

References (20)

1. R. Bartholo, C.A. Cosenza, F.A. Doria, and C. Lessa Can economic systems be seen as computing devices? J. Econ. Behav. Organ. 70 2009 72 80
2. B.J. Copeland, and R. Sylvan Beyond the universal Turing machine Austral. J. Philos. 77 1999 46 67
3. N.C.A. da Costa, and F.A. Doria Undecidability and incompleteness in classical mechanics Int. J. Theor. Phys. 30 1991 1041 1073
4. N.C.A. da Costa, F.A. Doria, Suppes predicates and the construction of unsolvable, Problems in the axiomatized sciences, in: P. Humphreys (Ed.), Patrick Suppes, Scientific Philosopher, II, Kluwer, 1994, pp. 151-191.
5. N.C.A. da Costa, and F.A. Doria Variations on an original theme J. Casti, A. Karlqvist, Boundaries and Barriers 1996 Addison-Wesley
6. N.C.A. da Costa, and F.A. Doria Computing the future K. Vela Velupillai, Computability, Complexity and Constructivity in Economic Analysis 2005 Blackwell
7. M. Davis Hilbert's tenth problem is unsolvable Am. Math. Mon. 80 1973 233
8. F.A. Doria Informal vs. formal mathematics Synthse 154 2007 401 415
9. S. Feferman Transfinite recursive progressions of axiomatic theories J. Symbolic Logic 27 1962 259
10. T. Franzen Transfinite progressions: a second look at completeness Bull. Symbolic Logic 10 2004 367 389
11. R. Havemann Dialektik ohne Dogma? 1964 Rowohlt
12. E. Mendelson Introduction to Mathematical Logic fourth ed. 1997 Chapman & Hall
13. D. Richardson Some undecidable problems involving elementary functions of a real variable J. Symbolic Logic 33 1968 514
14. H. Rogers Jr. Theory of Recursive Functions and Effective Computability 1967 John Wiley
15. B. Scarpellini Two undecidable problems of analysis Minds Mach. 13 2003 49 77
16. B. Scarpellini Comments to two undecidable problems of analysis Minds Mach. 13 2003 79 85
17. I. Stewart Deciding the undecidable Nature 352 1991 664 665
18. P. Suppes, personal communication, 1990.
19. A.M. Turing On computable numbers, with an application to the Entscheidungsproblem Proc. London Math. Soc. 50 1937 230
20. A.M. Turing Systems of logic based on ordinals Proc. London Math. Soc., Ser. 45 2 1939 161