This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

28 found
Order:
  1. On the Physical Possibility of Ordinal Computation (Draft).Jeffrey A. Barrett & Wayne Aitken - unknown
    α-recursion lifts classical recursion theory from the first transfinite ordinal ω to an arbitrary admissible ordinal α [10]. Idealized computational models for α-recursion analogous to Turing machine models for classical recursion have been proposed and studied [4] and [5] and are applicable in computational approaches to the foundations of logic and mathematics [8]. They also provide a natural setting for modeling extensions of the algorithmic logic described in [1] and [2]. On such models, an α-Turing machine can complete a θ-step (...)
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  2. Computationalism is Dead; Now What?Selmer Bringsjord - unknown
    In this paper I place Jim Fetzer's esemplastic burial of the computational conceptionof mind within the context of both my own burial and the theory of mind I would put in place of this dead doctrine. My view..
    Remove from this list  
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  3. The Impact of Computing on Epistemology: Knowing Gödel's Mind Through Computation.Selmer Bringsjord - unknown
    I know that those of you who know my mind know that I think I know that we can't know Gödel's mind through computation: ``The Impact : Failing to Know " If computationalism is false, observant philosophers willing to get their hands dirty should be able to find tell-tale signs today: automated theorem proving tomorrow (Eastern APA): robots as zombanimals But let's start with little 'ol me, and literary, not mathematical, creativity: Selmer (samples) vs. Brutus1 (samples again).
    Remove from this list  
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  4. From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations.Mark Burgin & Gordana Dodig-Crnkovic - 2013 - In Gordana Dodig-Crnkovic Raffaela Giovagnoli (ed.), Computing Nature. pp. 241--253.
    In this paper we analyze methodological and philosophical implications of algorithmic aspects of unconventional computation. At first, we describe how the classical algorithmic universe developed and analyze why it became closed in the conventional approach to computation. Then we explain how new models of algorithms turned the classical closed algorithmic universe into the open world of algorithmic constellations, allowing higher flexibility and expressive power, supporting constructivism and creativity in mathematical modeling. As Goedels undecidability theorems demonstrate, the closed algorithmic universe restricts (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  5. Notes on Landauer's Principle, Reversible Computation, and Maxwell's Demon.H. C. - 2003 - Studies in History and Philosophy of Science Part B 34 (3):501-510.
    Landauer's principle, often regarded as the basic principle of the thermodynamics of information processing, holds that any logically irreversible manipulation of information, such as the erasure of a bit or the merging of two computation paths, must be accompanied by a corresponding entropy increase in non-information-bearing degrees of freedom of the information-processing apparatus or its environment. Conversely, it is generally accepted that any logically reversible transformation of information can in principle be accomplished by an appropriate physical mechanism operating in a (...)
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  6. Why We Shouldn't Reason Classically, and the Implications for Artificial Intelligence.Douglas Campbell - 2016 - In C. Vincent Müller (ed.), Computing and Philosophy: Selected Papers From Iacap 2014. Springer Verlag. pp. 151--165.
    In this paper I argue that human beings should reason, not in accordance with classical logic, but in accordance with a weaker ‘reticent logic’. I characterize reticent logic, and then show that arguments for the existence of fundamental Gödelian limitations on artificial intelligence are undermined by the idea that we should reason reticently, not classically.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7. 'Turing Limit'. Some of Them (Steinhart, Copeland) Represent Extensions of Tur-Ing's Account, Whereas Others Defend Alternatives Notions of Effective Computability (Bringsjord and Zenzen, Wells).Carol E. Cleland - 2002 - Minds and Machines 12:157-158.
  8. 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.
    Remove from this list   Direct download (12 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  9. Super Turing-Machines.Jack Copeland - 1998 - Complexity 4 (1):30-32.
    The tape is divided into squares, each square bearing a single symbol—'0' or '1', for example. This tape is the machine's general-purpose storage medium: the machine is set in motion with its input inscribed on the tape, output is written onto the tape by the head, and the tape serves as a short-term working memory for the results of intermediate steps of the computation. The program governing the particular computation that the machine is to perform is also stored on the (...)
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  10. 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 (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  11. A Brief Critique of Pure Hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
    Hypercomputation—the hypothesis that Turing-incomputable objects can be computed through infinitary means—is ineffective, as the unsolvability of the halting problem for Turing machines depends just on the absence of a definite value for some paradoxical construction; nature and quantity of computing resources are immaterial. The assumption that the halting problem is solved by oracles of higher Turing degree amounts just to postulation; infinite-time oracles are not actually solving paradoxes, but simply assigning them conventional values. Special values for non-terminating processes are likewise (...)
    Remove from this list   Direct download (11 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  12. Why There is No Such Discipline as Hypercomputation.Martin Davis - 2006 - Applied Mathematics and Computation, Volume 178, Issue 1, 1.
    Remove from this list  
     
    Export citation  
     
    My bibliography   2 citations  
  13. Eric Winsberg: Science in the Age of Computer Simulation. [REVIEW]Stefan Gruner - 2013 - Minds and Machines 23 (2):251-254.
  14. Ordinary Devices: Reply to Bringsjord's Clarifying the Logic of Anti-Computationalism: Reply to Hauser[REVIEW]Larry Hauser - 2000 - Minds and Machines 10 (1):115-117.
    What Robots Can and Can't Be (hereinafter Robots) is, as Selmer Bringsjord says "intended to be a collection of formal-arguments-that-border-on-proofs for the proposition that in all worlds, at all times, machines can't be minds" (Bringsjord, forthcoming). In his (1994) "Précis of What Robots Can and Can't Be" Bringsjord styles certain of these arguments as proceeding "repeatedly . . . through instantiations of" the "simple schema".
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    My bibliography  
  15. Why Godel's Theorem Cannot Refute Computationalism: A Reply to Penrose.Geoffrey Laforte, Pat Hayes & Kenneth M. Ford - 1998 - Artificial Intelligence 104.
  16. Effective Physical Processes and Active Information in Quantum Computing.Ignazio Licata - 2007 - Quantum Biosystems 1 (1):51-65.
    The recent debate on hypercomputation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics.We propose here the idea of “effective physical process” as the essentially physical notion of computation. By using the Bohm and Hiley active information concept we analyze the differences between the standard form (quantum gates) and the non-standard one (adiabatic and morphogenetic) of Quantum Computing, and we point out how its Super-Turing potentialities derive from an incomputable information (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  17. Physics of Emergence and Organization.Ignazio Licata & Ammar Sakaji (eds.) - 2008 - World Scientific.
    This book is a state-of-the-art review on the Physics of Emergence. Foreword v Gregory J. Chaitin Preface vii Ignazio Licata Emergence and Computation at the Edge of Classical and Quantum Systems 1 Ignazio Licata Gauge Generalized Principle for Complex Systems 27 Germano Resconi Undoing Quantum Measurement: Novel Twists to the Physical Account of Time 61 Avshalom C. Elitzur and Shahar Dolev Process Physics: Quantum Theories as Models of Complexity 77 Kirsty Kitto A Cross-disciplinary Framework for the Description of Contextually Mediated (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  18. Ideal Negative Conceivability and the Halting Problem.Manolo Martínez - 2013 - Erkenntnis 78 (5):979-990.
    Our limited a priori-reasoning skills open a gap between our finding a proposition conceivable and its metaphysical possibility. A prominent strategy for closing this gap is the postulation of ideal conceivers, who suffer from no such limitations. In this paper I argue that, under many, maybe all, plausible unpackings of the notion of ideal conceiver, it is false that ideal negative conceivability entails possibility.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  19. On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
    This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified such (...)
    Remove from this list   Direct download (10 more)  
     
    Export citation  
     
    My bibliography  
  20. Practical Intractability: A Critique of the Hypercomputation Movement. [REVIEW]Aran Nayebi - 2014 - Minds and Machines 24 (3):275-305.
    For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  21. Hypercomputation: Computing More Than the Turing Machine.Toby Ord - unknown
    In this report I provide an introduction to the burgeoning field of hypercomputation – the study of machines that can compute more than Turing machines. I take an extensive survey of many of the key concepts in the field, tying together the disparate ideas and presenting them in a structure which allows comparisons of the many approaches and results. To this I add several new results and draw out some interesting consequences of hypercomputation for several different disciplines.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  22. 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. (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  23. The Physical Church Thesis and Physical Computational Complexity.Itamar Pitowski - 1990 - Iyyun 39:81-99.
  24. The Physics of God and the Quantum Gravity Theory of Everything.James Redford - manuscript
    Analysis is given of the Omega Point cosmology, an extensively peer-reviewed proof (i.e., mathematical theorem) published in leading physics journals by professor of physics and mathematics Frank J. Tipler, which demonstrates that in order for the known laws of physics to be mutually consistent, the universe must diverge to infinite computational power as it collapses into a final cosmological singularity, termed the Omega Point. The theorem is an intrinsic component of the Feynman-DeWitt-Weinberg quantum gravity/Standard Model Theory of Everything (TOE) describing (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25. Counting Information: A Note on Physicalized Numbers. [REVIEW]Brian Rotman - 1996 - Minds and Machines 6 (2):229-238.
    Existing work on the ultimate limits of computation has urged that the apparatus of real numbers should be eschewed as an investigative tool and replaced by discrete mathematics. The present paper argues for a radical extension of this viewpoint: not only the continuum but all infinitary constructs including the rationals and the potential infinite sequence of whole numbers need to be eliminated if a self-consistent investigative framework is to be achieved.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26. The Church-Turing Thesis and Hyper-Computation.O. Shagrir & I. Pitowsky - forthcoming - Minds and Machines.
  27. Computation and Hypercomputation.Mike Stannett - 2003 - Minds and Machines 13 (1):115-153.
    Does Nature permit the implementation of behaviours that cannot be simulated computationally? We consider the meaning of physical computation in some detail, and present arguments in favour of physical hypercomputation: for example, modern scientific method does not allow the specification of any experiment capable of refuting hypercomputation. We consider the implications of relativistic algorithms capable of solving the (Turing) Halting Problem. We also reject as a fallacy the argument that hypercomputation has no relevance because non-computable values are indistinguishable from sufficiently (...)
    Remove from this list   Direct download (14 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  28. David Wolpert on Impossibility, Incompleteness, the Liar Paradox, the Limits of Computation, a Non-Quantum Mechanical Uncertainty Principle and the Universe as Computer—the Ultimate Theorem in Turing Machine Theory.Michael Starks - manuscript
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography