See this document in CiteSeerX!

unknown  (Make Corrections)  
Eugene Eberbach Comp Eugene Eberbach Comp. and Inf. Science Dept. University of Massachusetts North...



  Home/Search   Context   Related

 
View or download:
umassd.edu/~eeberbach/pa...BeyondTM.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umassd.edu/~eeberbach...paperlist (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we describe and analyze models of problem solving and computation going beyond Turing Machines. Three principles of extending the Turing Machine's expressiveness are identified, namely, by interaction, evolution and infinity. Several models utilizing the above principles are presented. (Update)

Active bibliography (related documents):   More   All
1.7:   New Models of Computation - Peter Wegner Dept   (Correct)
1.7:   Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded   (Correct)
1.1:   Expressing Evolutionary Computation, Genetic Programming, Artif.. - Eberbach (2000)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ comp-unknown,
  author = "Eugene Eberbach Comp",
  title = "unknown",
  url = "citeseer.ist.psu.edu/764451.html" }
Citations (may not include all citations):
854   Information and Computation (context) - Milner, Parrow et al. - 1992
484   A Calculus of Communicating Systems (context) - Milner - 1980
291   A Logical Calculus of the Ideas Immanent in Nervous Activity (context) - McCulloch, Pitts - 1943
249   Molecular Computation of Solutions to Combinatorial Problems - Adleman - 1994
148   The Perceptron: A Probabilistic Model for Information Storag.. (context) - Rosenblatt - 1958
129   Handbook of Evolutionary Computation (context) - Back, Fogel et al. - 1997
127   with an Application to the Entscheidungsproblem (context) - Turing - 1936
118   the Church-Turing Principle and the Universal Quantum Comput.. (context) - Deutsch - 1985
116   Simulating Physics with Computers - Feynman - 1982
94   Why Interaction is More Powerful Than Algorithms - Wegner - 1997
86   DNA Solutions of Hard Computational Problems (context) - Lipton - 1995
80   Theory of Self-Reproducing Automata (context) - Von Neumann - 1966
55   Essays on Cellular Automata (context) - Burks - 1970
54   Handbook of Process Algebra (context) - Bergstra, Ponse et al. - 2001
50   An Unsolvable Problem of Elementary Number Theory (context) - Church - 1936
45   Interactive Foundations of Computing - Wegner - 1998
41   Computability with Low-Dimensional Dynamical Systems (context) - Koiran, Cosnard et al. - 1994
40   Elements of Interaction (context) - Milner - 1993
36   Neural Networks and Analog Computation: Beyond the Turing Li.. (context) - Siegelmann - 1999
31   Systems of Logic based on Ordinals (context) - Turing - 1939
27   Principia Mathematica (context) - Whitehead, Russell - 1910
22   Neural Computability (context) - Garzon, Franklin - 1989
21   Models of Massive Parallelism: Analysis of Cellular Automata.. (context) - Garzon - 1995
17   Persistent Turing Machines as a Model of Interactive Computa.. - Goldin - 2000
14   Intelligent Machinery (context) - Turing - 1992
13   Coinductive Models of Finite Computing Agents - Wegner, Goldin - 1999
9   Calculus Bounded Rationality = Process Algebra + Anytime Alg.. (context) - Eberbach - 2001
8   Calculus: What Matters (context) - Eberbach, Expressiveness - 2000
7   The Turing Machine Paradigm in Contemporary Computing - Van Leeuwen, Wiedermann - 2001
7   Turing's Ideas and Models of Computation (context) - Eberbach, Goldin et al. - 2003
6   How We Know What Technology Can Do (context) - Burgin - 2001
4   On Expressiveness of Evolutionary Computation: Is EC Algorit.. - Eberbach - 2002
4   and Interaction: Essays in Honour of Robin Milner (context) - Plotkin, Stirling et al. - 2000
3   Beyond Undecidability of Turing Machines and Its Consequence.. (context) - Eberbach - 2003
3   DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - Beaver, Molecular - 1996
3   Super-Turing Machines - Copeland - 1998
3   The British Computer Society (context) - Wegner, Eberbach - 2004
3   th Int'l Workshop on Expressiveness in Concurrency (context) - Goldin, Smolka et al. - 2001
2   DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - Smith - 1996
2   under Bounded Resources (context) - Horvitz, Zilberstein et al. - 2001
2   Collected Works Volume III: Unpublished Essays and Lectures (context) - odel - 1995
2   Computation Beyond Turing Machines: Seeking Appropriate Meth.. (context) - Wegner, Goldin - 2003
1   Uber formal unedtscheidbare Satze der Principia Mathematica .. (context) - odel - 1931

Documents on the same site (http://www.cis.umassd.edu/~eeberbach/paperlist.html):   More
Evolutionary Computation as a Multi-Agent Search: a $-Calculus.. - Eberbach (2001)   (Correct)
Flexible Optimization And Evolution Of Underwater.. - Eberbach, Brooks, Phoha (1999)   (Correct)
Expressing Evolutionary Computation, Genetic Programming, Artif.. - Eberbach (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC