Switch to: References

Add citations

You must login to add citations.
  1. Decision problems for differential equations.J. Denef & L. Lipshitz - 1989 - Journal of Symbolic Logic 54 (3):941-950.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Turing's o-machines, Searle, Penrose, and the brain.Jack Copeland - 1998 - Analysis 58 (2):128-138.
    In his PhD thesis (1938) Turing introduced what he described as 'a new kind of machine'. He called these 'O-machines'. The present paper employs Turing's concept against a number of currently fashionable positions in the philosophy of mind.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Turing's O-machines, Searle, Penrose and the brain.B. J. Copeland - 1998 - Analysis 58 (2):128-138.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
    A survey of the field of hypercomputation, including discussion of a variety of objections.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
    We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of well-defined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a philosophical defence of its foundations.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Beyond the universal Turing machine.B. Jack Copeland & Richard Sylvan - 1999 - Australasian Journal of Philosophy 77 (1):46-66.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Undecidability through Fourier series.Peter Buser & Bruno Scarpellini - 2016 - Annals of Pure and Applied Logic 167 (7):507-524.
    Download  
     
    Export citation  
     
    Bookmark  
  • Recursive analysis of singular ordinary differential equations.Peter Buser & Bruno Scarpellini - 2010 - Annals of Pure and Applied Logic 162 (1):20-35.
    We investigate systems of ordinary differential equations with a parameter. We show that under suitable assumptions on the systems the solutions are computable in the sense of recursive analysis. As an application we give a complete characterization of the recursively enumerable sets using Fourier coefficients of recursive analytic functions that are generated by differential equations and elementary operations.
    Download  
     
    Export citation  
     
    Bookmark  
  • A notion of mechanistic theory.G. Kreisel - 1974 - Synthese 29 (1-4):11 - 26.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
    A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine - a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, sometimes incorrectly termed the 'Church-Turing thesis', is the claim that the class of functions that can be computed by machines is identical to the class of functions that can be computed by (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations