What Is Hypercomputation?

Bibliographies

1. Burgin, Mark, & Wegner, Peter (organizers) (2003), Special Sessions on Beyond Classical Boundaries of Computability [PDF] (Parts I,II,III, & IV),2003 Spring Western Section Meeting, American Mathematical Society.
   • Excerpts from the program, plus abstracts of some of the talks.

Articles

1. Wegner, Peter (1997), "Why Interaction Is More Powerful than Algorithms", Communications of the ACM 40(5) (May): 80-91.
   • Many of Wegner's papers are online in various formats at his homepage (click on his name).

   • A 1994 email exchange with Wegner on the subject of interactive computing, message passing, and AI actors, with numerous references.

   • Follow-up papers by Wegner:
     1. Wegner, Peter (1999), "Towards Empirical Computer Science", The Monist 82(1) (January): 58-108.

     2. Eberbach, Eugene; & Wegner, Peter (2003), "Beyond Turing Machines" [PDF], Bulletin of the European Association for Theoretical Computer Science (EATCS) No. 81 (October): 279-304.
        • This is best compared to Copeland 2002 as being a good survey, with good references.

     3. Wegner, Peter & Goldin, Dina (2003), "Computation beyond Turing Machines", Communications of the ACM 46(4) (April): 100-102.

2. Copeland, B. Jack, & Proudfoot, Diane (1999), "Alan Turing's Forgotten Ideas in Computer Science", Scientific American (April): 98-103.
   • For a reply, see:
     Hodges, Andrew, "The Professors and the Brainstorms"

   • Follow-up items by, or edited by, Copeland:
     1. Copeland, B. Jack (2002), "Accelerating Turing Machines", Minds and Machines 12(2) (May): 303-326.

     2. Copeland, B. Jack (guest ed.) (2002), Special Issue on Hypercomputation, Minds and Machines 12(4) (November).
        • Click on title for full table of contents.
        • Contains the following two, very interesting papers:
          1. Copeland, B. Jack (2002), "Hypercomputation" [PDF], pp. 461-502.
             • A good overview and survey.

          2. Kugel, Peter (2002), "Computing Machines Can't Be Intelligent (...and Turing Said So)" [PDF], pp. 563-579.
             • This paper has almost convinced me that there just might be something to all of this "hype" about "hypercomputation".

             • For more information on the application of Putnam-Gold machines to "computational learning theory", see:
               1. John Case's COLT Page

               2. Nowak, Martin A.; Komarova, Natalia L.; & Niyogi, Partha (2002), "Computational and Evolutionary Aspects of Language", Nature 417 (6 June): 611-617.

             • On Putnam-Gold machines, see also:
               • Gold, E. Mark (1967), "Language Identification in the Limit", Information and Control 10: 447-474.

               • Johnson, Kent (2004), "Gold's Theorem and Cognitive Science", Philosophy of Science 71 (October): 571-592.

     3. Copeland, B. Jack (guest ed.) (2003), Special Issue on Hypercomputation (continued), Minds and Machines 13(1) (February).
        • Click on title for full table of contents.

3. Milner, Robin (1993), "Elements of Interaction", Communications of the ACM 36(1) (January): 78-89.

4. Schächter, Vincent (1999), "How Does Concurrency Extend the Paradigm of Computation?", The Monist 82(1) (January): 37-57.

5. Davies, E.B. (2001), "Building Infinite Machines", British Journal for the Philosophy of Science 52: 671-682.

6. Bringsjord, Selmer, & Zenzen, Michael (2002), "Toward a Formal Philosophy of Hypercomputation", Minds and Machines 12(2) (May): 259-280.

7. Steinhart, Eric (2002), "Logically Possible Machines", Minds and Machines 12(2) (May): 281-301.

8. Cotogno, P. (2003), "Hypercomputation and the Physical Church-Turing Thesis", British Journal for the Philosophy of Science 54(2): 181-224.

9. Davis, Martin (200x), "The Myth of Hypercomputation".

10. 
    Chaitin, Gregory (2004-2005), "How Real Are Real Numbers?".

11. 
    Hypocomputation: If "hyper"computation is computing that is "above" the Turing "speed limit", so to speak, then "hypo"computation is computing "below" it.
    1. Lindell, Steven (2004), "Revisiting Finite-Visit Computations" [PDF slide show]
       • Abstract: Incorporating matter and energy requirements into physically implemented machines sheds new light on feasible computability. Under certain circumstances, conventional mathematical models may not be asymptotically realizable due to the limited availability of resources required to store data and execute instructions.

    2. 
       Lindell, Steven (2006), "A Physical Analysis of Mechanical Computability" [PDF slide show]
       • Abstract: Turing's model of autonomous computation is based on the idealized psychological characteristics of a human calculator—its ability to change its "state of mind" in a stepwise fashion based on the recognition of symbolic configurations. This leads to a mathematical model of effective computability, with its well known capabilities and limitations. We extend this analysis to the idealized physiological characteristics of a machine computer—its ability to manipulate matter using energy. This leads to a new notion of feasibility based on physical resource bounds, in which mass and energy constraints further restrict the usual notions of space and time complexity.