Toward a theory of intelligence

Theoretical Computer Science

Volumn 317, Issue 1-3, 2004, Pages 13-30

  Kugel, Peter ^a  

^a BOSTON COLLEGE   (United States)

Author keywords

Artificial intelligence; Hypercomputers; Intelligence; Super recursive algorithms

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SYSTEMS; COMPUTERS;

HYPERCOMPUTERS; INTELLIGENCE; SUPER-RECURSIVE ALGORITHMS;

COMPUTER SCIENCE;

EID: 2442617154     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.002     Document Type: Conference Paper

References (26)

1. Angluin D., Smith C.H. Inductive inference. theory and methods Comput. Surv. 3:1983;237-269.
2. Burgin M.S. Inductive Turing machines. Sov. Math. Dokl. 270:1983;1289-1293.
3. M.S. Burgin, Super-recursive algorithms as a tool for high performance computing, Proc. High Performance of Computer Symposium, San Diego, 1999, pp. 224-228.
4. Burgin M.S. How we know what technology can do. Comm. ACM. 44:2001;82-88.
5. Chomsky N. Aspects of the Theory of Syntax. 1965;MIT Press, Cambridge.
6. Copeland B.J., Proudfoot D. Alan Turing's forgotten ideas in computer science. Sci. Amer. 280:1999;76-81.
7. Cotogno P. Hypercomputation and the physical Church-Turing thesis. British J. Philos. Sci. 54:2003;181-223.
8. Gardner H. Frames of Mind: The Theory of Multiple Intelligences. 1983;Basic Books, New York.
9. Gödel K. Die Vollständikeit der Axiome des logischen Funktionenkalküls. Monatsh Math. Phys. 37:1930;349-360.
10. Gold E.M. Limiting recursion. J. Symbolic Logic. 30:1965;28-48.
11. Kieu T.D. Quantum algorithm for the Hilbert's tenth problem. Contemp. Phys. 44:2003;51-71.
12. Kleene S.C. Recursive predicates and quantifiers. Trans. Amer. Math. Soc. 53:1943;41-73.
13. Kleene S.C. Representation of events in nerve nets and finite automata. Shannon C.E., McCarthy J. Automata Studies. Annals of Mathematics Studies. Vol. 34:1956;3-41 Princeton University Press, Princeton, NJ.
14. Kugel P. Induction pure and simple. Inform. and Control. 35:1977;276-336.
15. Kugel P. Computing machines can't be intelligent. ( ⋯ and Turing said so) Minds Mach. 12(4):2002;563-579.
16. Kuhn T. The Structure of Scientific Revolutions. 1962;University of Chicago Press, Chicago.
17. Matiyasevich Yu.V. Solution of the tenth problem of Hilbert. Mat. Lapok. 21:1970;83-87.
18. Popper K. The Logic of Scientific Discovery, (translation of Logik der Forschung). 1959;Hutchinson, London.
19. Putnam H. Trial and error predicates and the solution of a problem of Mostowski. J. Symbolic Logic. 20:1965;49-57.
20. Saxe R., Kanwisher N. People thinking about thinking people. The role of the temporo-partietal junction in "theory of mind" Neuroimage. 19:2003;1835-1842.
21. Siegelmann H. Computation beyond the Turing limit. Science. 268:1995;545-548.
22. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. Ser. 2. 42:1936;232-265.
23. Turing A.M. Systems of logic based on ordinals. Proc. London Math. Soc. Ser. 2. 45:1939;161-228.
24. Turing A.M. Computing machinery and intelligence. Mind. 59(N.S. 236):1950;433-460.
25. Turing A.M. Proposals for the development in the Mathematics Division of an Automatic Computing Engine (ACE). Carpenter B.E., Doran R.N. A.M. Turing's ACE Report and Other Papers. 1986;MIT Press, Cambridge, MA.
26. Turing A.M. Lecture to The London Mathematical Society on 20 February 1947. Carpenter B.E., Doran R.N. A.M. Turing's ACE Report and Other Papers. 1986;MIT Press, Cambridge, MA.