New Models of Computation

Computer Journal

Volumn 47, Issue 1, 2004, Pages 4-9

  Wegner, Peter ^a   Eberbach, Eugene ^b  

^a Brown Univerity   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; DECISION THEORY; INTERNET; ITERATIVE METHODS; PROBLEM SOLVING; ROBOTICS;

DYNAMIC INTERACTION; INFINITE ADAPTATIONS;

TURING MACHINES;

EID: 0347946774     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.1.4     Document Type: Article

References (29)

1. Turing, A. (1936) On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc., 42(2), 230-265. A correction (1937), ibid, 43, 544-546.
2. Turing, A. (1936) On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc., 42(2), 230-265. A correction (1937), ibid, 43, 544-546.
3. Hilbert, D. and Ackerman, W. (1928) Grundzüge der Theoretischen Logik. Springer-Verlag, Berlin.
4. Turing, A. (1939) Systems of logic based on ordinals. Proc. London Math. Soc. Ser. 2, 45, 161-228.
5. Gödel, K. (1931) Über formal unedtscheidbare Sätze der Principia Mathematica und verwandter Systeme, I. Monatschefte für Mathematik und Physik, 38, 173-198.
6. Church, A. (1936) An unsolvable problem of elementary number theory. Am. J. Mathematics, 58, 345-363.
7. ACM Curriculum Committee (1968) Curriculum 68: Recommendations for academic programs in computer science. A Report of the ACM Curriculum Committee on Computer Science. Commun. ACM, 11, 151-169.
8. Eberbach, E., Goldin, D. and Wegner, P. (2003) Turing's ideas and models of computation. In Teuscher, Ch. (ed.), Alan Turing: Life and Legacy of a Great Thinker. Springer-Verlag, Berlin, Heidelberg, New York.
9. Wegner, P. and Goldin, D. (2003) Computation beyond Turing Machines: seeking appropriate methods to model computing and human thought. CACM, 46(4), 100-102.
10. Wegner, P. (1997) Why interaction is more powerful than algorithms. CACM, 40(5), 81-91.
11. Wegner, P. (1998) Interactive foundations of computing. Theor. Comp. Sci., 192, 315-351.
12. Goldin, D., Smolka, S. and Wegner, P. (2001) Turing Machines, Transition Systems, and Interaction. In Proc. 8th Int. Workshop on Expressiveness in Concurrency, August 2001. Aalborg, Denmark.
13. Milner, R., Parrow, J. and Walker, D. (1992) A calculus of mobile processes, I & II. Information and Computation, 100, 1-77.
14. Milner, R. (1993) Elements of interaction. CACM, 36(1), 78-89.
15. Plotkin, G., Stirling, C. and Tofte, M. (eds) (2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner. The MIT Press, Cambridge and London.
16. Milner, R. (1980) A Calculus of Communicating Systems, LNCS 94. Springer-Verlag, Berlin, Heidelberg, New York.
17. Church, A. (1941) The Calculi of Lambda Conversion, Princeton University Press.
18. Garzon, M. (1995) Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks, An EATCS series. Springer-Verlag, Berlin, Heidelberg, New York.
19. Eberbach, E., Brooks, R. and Phoha, S. (1999) Flexible Optimization and Evolution of Underwater Autonomous Agents. In Zhong, N., Skowron, A. and Ohsuga, S. (eds), New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, Proc. 7th Int. Workshop on Rough Sets, Fuzzy Sets, Data Mining and Granular-Soft Computing RSFDGrC'99, Yamaguchi, Japan, LNAI 1711, pp. 519-527. Springer-Verlag, Berlin, Heidelberg, New York.
20. Eberbach, E. (2001) $-Calculusboundedrationality = process algebra + anytime algorithms. In Misra J. C. (ed.), Applicable Mathematics: Its Perspectives and Challenges, Chapter 22, pp. 213-220. Narosa Publishing House, New Delhi, Mumbai, Calcutta.
21. Eberbach, E. (2003) Is Entscheidungsproblem solvable? Beyond undecidability of Turing Machines and its consequence for computer science and mathematics. In Misra, J. C. (ed.), Computational Mathematics, Modelling and Algorithms, Chapter 1, pp. 1-32. Narosa Publishing House, New Delhi, Mumbai, Calcutta.
22. Horvitz, E. and Zilberstein, S. (eds) (2001) Computational tradeoffs under bounded resources. Artificial Intelligence, 126, 1-196.
23. Turing, A. (1992) Intelligent machinery. In Ince, D. C. (ed.), Collected Works of A.M. Turing: Mechanical Intelligence. Elsevier Science.
24. Von Neumann, J. (1966) Theory of Self-Reproducing Automata, (edited and completed by Burks, A. W.). University of Illinois Press, Urbana and London.
25. Van Leeuwen, J. and Wiedermann, J. (2000) The Turing Machine paradigm in contemporary computing. In Enquist, B. and Schmidt, W. (eds), Mathematics Unlimited - 2001 and Beyond, LNCS. Springer-Verlag.
26. Siegelmann, H. (1999) Neural Networks and Analog Computation: Beyond the Turing Limit. Birkhäuser, Boston, Basel, Berlin.
27. Eberbach, E. (2002) On expressiveness of evolutionary computation: is EC algorithmic? In Proc. 2002 World Congress on Computational Intelligence (WCCI), Honolulu, HI, May 12-17, 2002, pp. 564-569.
28. Burgin, M. (2001) How we know what technology can do. CACM, 44(11), 83-88.
29. Copeland, B. J. (1998) Super-Turing machines. Complexity, 4(1), 30-32.