Switch to: Citations

Add references

You must login to add references.
  1. Anthropic bias: observation selection effects in science and philosophy.Nick Bostrom - 2002 - New York: Routledge.
    _Anthropic Bias_ explores how to reason when you suspect that your evidence is biased by "observation selection effects"--that is, evidence that has been filtered by the precondition that there be some suitably positioned observer to "have" the evidence. This conundrum--sometimes alluded to as "the anthropic principle," "self-locating belief," or "indexical information"--turns out to be a surprisingly perplexing and intellectually stimulating challenge, one abounding with important implications for many areas in science and philosophy. There are the philosophical thought experiments and paradoxes: (...)
    Download  
     
    Export citation  
     
    Bookmark   114 citations  
  • What is Mathematics? [REVIEW]E. N. - 1942 - Journal of Philosophy 39 (8):221-221.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • In computation, parallel is nothing, physical everything.Selmer Bringsjord - 2001 - Minds and Machines 11 (1):95-99.
    Andrew Boucher (1997) argues that ``parallel computation is fundamentally different from sequential computation'' (p. 543), and that this fact provides reason to be skeptical about whether AI can produce a genuinely intelligent machine. But parallelism, as I prove herein, is irrelevant. What Boucher has inadvertently glimpsed is one small part of a mathematical tapestry portraying the simple but undeniable fact that physical computation can be fundamentally different from ordinary, ``textbook'' computation (whether parallel or sequential). This tapestry does indeed immediately imply (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Cognition is not computation: The argument from irreversibility.Selmer Bringsjord - 1997 - Synthese 113 (2):285-320.
    The dominant scientific and philosophical view of the mind – according to which, put starkly, cognition is computation – is refuted herein, via specification and defense of the following new argument: Computation is reversible; cognition isn't; ergo, cognition isn't computation. After presenting a sustained dialectic arising from this defense, we conclude with a brief preview of the view we would put in place of the cognition-is-computation doctrine.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • .Jeremy Butterfield & John Earman - 1977
    Download  
     
    Export citation  
     
    Bookmark   369 citations  
  • On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
    Download  
     
    Export citation  
     
    Bookmark   712 citations  
  • Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1984 - Journal of Symbolic Logic 49 (3):989-990.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
    Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
    We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Everyset. for example, is decidable by such machines, and the semi-decidable sets form a portion of thesets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Introductory Modal Logic.Kenneth Konyndyk - 1986 - University of Notre Dame Press.
    Modal logic, developed as an extension of classical propositional logic and first-order quantification theory, integrates the notions of possibility and necessity and necessary implication. Arguments whose understanding depends on some fundamental knowledge of modal logic have always been important in philosophy of religion, metaphysics, and epistemology. Moreover, modal logic has become increasingly important with the use of the concept of "possible worlds" in these areas. Introductory Modal Logic fills the need for a basic text on modal logic, accessible to students (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • .Nick Bostrom & Julian Savulescu - 2009 - Oxford University Press.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • A Primer on Determinism.John Earman - 1986 - D. Reidel.
    Determinism is a perennial topic of philosophical discussion. Very little acquaintance with the philosophical literature is needed to reveal the Tower of ...
    Download  
     
    Export citation  
     
    Bookmark   305 citations  
  • Digital Mechanics - An informational process based on reversible universal cellular automata.Edward Fredkin - 1990 - Physica D 45 (1-3):254-70.
    This paper is written from the perspective of a computer scientist and addressed to theoretical physicists. As a consequence it may seem somewhat unusual, but rest assured, everything is really quite simple! The point of this paper is that the study of certain phenomena from computer science suggests that there are computer systems (cellular automata) that may be appropriate as models for microscopic physical phenomena. Cellular automata are now being used to model varied physical phenomena normally modelled by wave equations, (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Simulating physics with computers.R. P. Feynman - 1982 - International Journal of Theoretical Physics 21 (6):467-488.
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
    Accelerated Turing machines are Turing machines that perform tasks commonly regarded as impossible, such as computing the halting function. The existence of these notional machines has obvious implications concerning the theoretical limits of computability.
    Download  
     
    Export citation  
     
    Bookmark   12 citations