Switch to: References

Citations of:

Logically possible machines

Minds and Machines 12 (2):259-280 (2002)

Add citations

You must login to add citations.
  1. The Tractable Cognition Thesis.Iris Van Rooij - 2008 - Cognitive Science 32 (6):939-984.
    The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance theTractable Cognition thesis: Human cognitive capacities are constrained by computational tractability. This thesis, if true, serves cognitive psychology by constraining the space of computational‐level theories of cognition. To utilize this constraint, a precise and workable definition of “computational tractability” is needed. Following computer science tradition, many cognitive scientists and psychologists define computational tractability as polynomial‐time computability, leading to theP‐Cognition thesis. This article (...)
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
    If the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible machines whose powers exceed the Church–Turing limit (e.g. accelerating Turing machines). Some of these supermachines realize superminds. Superminds perform cognitive supertasks. Their thoughts are formed in infinitary languages. They perceive and manipulate the infinite detail of fractal objects. They (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
    Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Superminds: People Harness Hypercomputation, and More.Mark Phillips, Selmer Bringsjord & M. Zenzen - 2003 - Dordrecht, Netherland: Springer Verlag.
    When Ken Malone investigates a case of something causing mental static across the United States, he is teleported to a world that doesn't exist.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   16 citations