Non-Turing Computers and Non-Turing Computability

@article{Hogarth1994NonTuringCA,
  title={Non-Turing Computers and Non-Turing Computability},
  author={M. Hogarth},
  journal={PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association},
  year={1994},
  volume={1994},
  pages={126 - 138}
}
  • M. Hogarth
  • Published 1994
  • Mathematics
  • PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association
  • A true Turing machine (TM) requires an infinitely long paper tape. Thus a TM can be housed in the infinite world of Newtonian spacetime (the spacetime of common sense), but not necessarily in our world, because our world-at least according to our best spacetime theory, general relativity-may be finite. All the same, one can argue for the "existence" of a TM on the basis that there is no such housing problem in some other relativistic worlds that are similar ("close") to our world. But curiously… CONTINUE READING
    Non-Turing Computations Via Malament–Hogarth Space-Times
    • 161
    • PDF
    Relativistic computers and the Turing barrier
    • 70
    • PDF
    0 Fe b 20 02 Non-Turing computations via Malament – Hogarth spacetimes
    • 18
    Hypercomputation: computing more than the Turing machine
    • T. Ord
    • Mathematics, Computer Science
    • 2002
    • 75
    • PDF
    General relativistic hypercomputing and foundation of mathematics
    • 36
    • PDF
    Relativistic Computers and Non-uniform Complexity Theory
    • 24
    • PDF
    Accelerating Turing Machines
    • 83
    • PDF
    Physical Hypercomputation and the Church–Turing Thesis
    • 63
    • Highly Influenced
    • PDF
    Quantum Speed‐up of Computations
    • 22
    New Computational Paradigms: Changing Conceptions of What is Computable
    • 97
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES
    Computability and logic
    • 772
    The Large Scale Structure of Space-Time
    • 7,545
    • Highly Influential
    • PDF
    On Computable Numbers, with an Application to the Entscheidungsproblem
    • 7,061
    • PDF
    Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes
    • 121
    • Highly Influential
    Does general relativity allow an observer to view an eternity in a finite time?
    • 115
    • PDF
    " Computability as a Physical Modality
    • 1992
    Bangs, Crunches, Wimpers, and Shrieks: Singularities and Acausality in Relativistic Spacetimes
    • 1994
    Bangs, Crunches, Wimpers, and Shrieks: Singularities and Acausality in Relativistic Spacetimes. Forthcoming book
    • 1994
    Modern Science and Zeno's Paradoxes
    • 103