Turing's O-machines, Searle, Penrose and the brain

Analysis

Volumn 58, Issue 2, 1998, Pages 128-138

  Copeland, B Jack ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 61249477110     PISSN: 00032638     EISSN: 14678284     Source Type: Journal    
DOI: 10.1093/analys/58.2.128     Document Type: Review

References (37)

1. Block, N. 1990. The computer model of the mind. In An Invitation to Cognitive Science, Vol. 3: Thinking, ed. D. Osherson and H. Lasnik. Cambridge, Mass.: MIT Press.
2. Church, A. 1936. An unsolvable problem of elementary number theory. American Journal of Mathematics 58: 345-63.
3. Churchland, P. M., and P. S. Churchland. 1983. Stalking the wild epistemic engine. Noûs 17: 5-18.
4. Churchland, P. M., and P. S. Churchland. 1990. Could a machine think? Scientific American 262 (Jan.): 26-31.
5. da Costa, N. and F. Doria. 1991. Classical physics and Penrose's thesis. Foundations of Physics Letters 4: 363-73.
6. Doyle, J. 1982. What is Church's thesis? Laboratory for Computer Science, MIT.
7. Dreyfus, H. 1992. What Computers Still Can't Do: A Critique of Artificial Reason. Cambridge, Mass.: MIT Press.
8. Fodor, J. 1981. The mind-body problem. Scientific American 244 (Jan.): 124-32.
9. Fodor, J. 1983. The Modularity of Mind. Cambridge, Mass.: MIT Press.
10. Friedberg, R. 1957. Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, 1944). Proceedings of the National Academy of Sciences (USA) 43: 236-38.
11. Geroch, R. and J. Hartle. 1986. Computability and physical theories. Foundations of Physics 16: 533-50.
12. Guttenplan, S. 1994. A Companion to the Philosophy of Mind. Oxford: Blackwell.
13. Johnson-Laird, P. 1987. How could consciousness arise from the computations of the brain?. In Mindwaves, ed. C. Blakemore and S. Greenfield. Oxford: Basil Blackwell.
14. Kleene, S. 1967. Mathematical Logic. New York: Wiley.
15. Komar, A. 1964. Undecidability of macroscopically distinguishable states in quantum field theory. Physical Review, second series, 133B: 542-44.
16. Kreisel, G. 1967. Mathematical logic: what has it done for the philosophy of mathematics? In Bertrand Russell: Philosopher of the Century, ed. R. Schoenman. London: George Allen and Unwin.
17. Kreisel, G. 1974. A notion of mechanistic theory. Synthese 29: 11-26.
18. Penrose, R. 1989. The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford: Oxford University Press.
19. Penrose, R. 1990. Précis of The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Behavioral and Brain Sciences 13: 643-55 and 692-705.
20. Penrose, R. 1994. Shadows of the Mind: A Search for the Missing Science of Consciousness. Oxford: Oxford University Press.
21. Penrose, R. 1996. Beyond the doubting of a shadow: a reply to commentaries on Shadows of the Mind. Psyche: An Interdisciplinary Journal of Research on Consciousness 2(23) [http://psyche.cs.monash.edu.au].
22. Pour-El, M. 1974. Abstract computability and its relation to the general purpose analog computer. Transactions of the American Mathematical Society 199: 1-28.
23. Pour-El, M. and I. Richards. 1979. A computable ordinary differential equation which possesses no computable solution. Annals of Mathematical Logic 17: 61-90.
24. Pour-El, M. and I. Richards. 1981. The wave equation with computable initial data such that its unique solution is not computable. Advances in Mathematics 39: 215-39.
25. Sacks, G. 1964. The recursively enumerable degrees are dense. Annals of Mathematics second series, 80: 300-12.
26. Scarpellini, B. 1963. Zwei unentscheitbare Probleme der Analysis. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 9: 265-89.
27. Searle, J. 1980. Minds, brains, and programs. Behavioral and Brain Sciences 3: 417-24.
28. Searle, J. 1989. Minds, Brains and Science: the 1984 Reith Lectures. London: Penguin.
29. Searle, J. 1992. The Rediscovery of the Mind. Cambridge, Mass.: MIT Press.
30. Searle, J. 1997. The Mystery of Consciousness. New York: New York Review.
31. Simpson, S. 1977. Degrees of unsolvability: a survey of results. In Handbook of Mathematical Logic, ed. J. Barwise. Amsterdam: North-Holland.
32. Stannett, M. 1990. X-machines and the halting problem: building a super-Turing machine. Formal Aspects of Computing 2: 331-41.
33. Turing, A. 1936. On computable numbers, with an application to the Entscheidungs-problem. Proceedings of the London Mathematical Society series 2, 42 (1936-37): 230-65.
34. Turing, A. 1938. Systems of logic based on ordinals. A dissertation presented to the faculty of Princeton University in candidacy for the degree of Doctor of Philosophy.
35. Turing, A. 1939. Systems of logic based on ordinals. Proceedings of the London Mathematical Society series 2, 45: 161-228.
36. Turing, A. 1950. Programmers' Handbook for Manchester Electronic Computer. University of Manchester Computing Laboratory.
37. Vergis, A., K. Steiglitz and B. Dickinson. 1986. The complexity of analog computation. Mathematics and Computers in Simulation 28: 91-113.