Computation beyond turing machines

ABSTRACT

Seeking appropriate methods to model computing and human thought.

REFERENCES

• 1: Association for Computing Machinery. Curriculum '68: Recommendations for academic programs in computer science. In ACM Curricula Recommendations for Computer Science. ACM, NY, 1968.
• 2: Rodney A. Brooks, Intelligence Without Reason, Massachusetts Institute of Technology, Cambridge, MA, 1991
• 3: Gödel, K. On formally undecidable propositions of principia mathematica and related systems. Monatshefte fur Mathematik und Physik, 38 1931 (in German); English translation in M. Davis, Ed., The Undecidable. Raven Press 1965.
• 4: Goldin, D. Smolka, S., and Wegner, P. Turing machines, transition systems, and interaction. In Proceedings of the 8th International Workshop on Expressiveness in Concurrency, Aarlborg, Denmark, August 2001.
• 5: Robin Milner, Elements of interaction: Turing award lecture, Communications of the ACM, v.36 n.1, p.78-89, Jan. 1993 [doi>10.1145/151233.151240]
• 6: Hava T. Siegelmann, Neural networks and analog computation: beyond the Turing limit, Birkhauser Boston Inc., Cambridge, MA, 1999
• 7: Turing, A. On computable numbers with an application to the Entscheidungsproblem. In Proceedings of the London Math Society 2, 42, 1936.
• 8: Turing, A. Intelligent machinery. In D.C. Ince, Ed., Mechanical Intelligence, North-Holland, 1992.
• 9: van Leeuwen, J. and Wiedermann, J. The Turing machine paradigm in contemporary computing. In B. Enquist and W. Schmidt, Eds., Mathematics Unlimited---2001 and Beyond. LNCS, Springer-Verlag, 2000.
• 10: Peter Wegner, Why interaction is more powerful than algorithms, Communications of the ACM, v.40 n.5, p.80-91, May 1997 [doi>10.1145/253769.253801]

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.2 HISTORY OF COMPUTING