Switch to: References

Add citations

You must login to add citations.
  1. A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer.Christian Wüthrich - 2015 - Synthese 192 (7):1989-2008.
    There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, Istvan Nemeti and Gyula David have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Theory of Quantum Computation and Philosophy of Mathematics. Part II.Krzysztof Wójtowicz - forthcoming - Logic and Logical Philosophy:1.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • The extent of computation in malament–hogarth spacetimes.P. D. Welch - 2008 - British Journal for the Philosophy of Science 59 (4):659-674.
    We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
    This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  • Programming Infinite Machines.Anton A. Kutsenko - 2019 - Erkenntnis 87 (1):181-189.
    For infinite machines that are free from the classical Thomson’s lamp paradox, we show that they are not free from its inverted-in-time version. We provide a program for infinite machines and an infinite mechanism that demonstrate this paradox. While their finite analogs work predictably, the program and the infinite mechanism demonstrate an undefined behavior. As in the case of infinite Davies machines :671–682, 2001), our examples are free from infinite masses, infinite velocities, infinite forces, etc. Only infinite divisibility of space (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • The machine as data: a computational view of emergence and definability.S. Barry Cooper - 2015 - Synthese 192 (7):1955-1988.
    Turing’s paper on computable numbers has played its role in underpinning different perspectives on the world of information. On the one hand, it encourages a digital ontology, with a perceived flatness of computational structure comprehensively hosting causality at the physical level and beyond. On the other, it can give an insight into the way in which higher order information arises and leads to loss of computational control—while demonstrating how the control can be re-established, in special circumstances, via suitable type reductions. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
    Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Computation in physical systems.Gualtiero Piccinini - 2010 - Stanford Encyclopedia of Philosophy.
    Direct download  
     
    Export citation  
     
    Bookmark   46 citations