Zeno machines and hypercomputation
From MaRDI portal
Publication:2503270
DOI10.1016/j.tcs.2005.11.040zbMath1097.68041arXivcs/0412022OpenAlexW2043649955WikidataQ55968645 ScholiaQ55968645MaRDI QIDQ2503270
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0412022
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The emerging discipline of biomolecular computation in the US
- Noncomputability in models of physical phenomena
- Experience, generations, and limits in machine learning
- Hypercomputation with quantum adiabatic processes
- Hypercomputation: Philosophical issues
- Note on a reformulation of the strong cosmic censor conjecture based on computability
- New computational paradigms. First conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8--12, 2005. Proceedings.
- Alan Turing: Life and Legacy of a Great Thinker
- Classical physics and the Church--Turing Thesis
- Quantum Information Theory and the Foundations of Quantum Mechanics
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Hypercomputation and the Physical Church‐Turing Thesis
- Can a Universal Quantum Computer Be Fully Quantum?
- A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
- Arithmetical representations of Brownian motion I
- Trial and error predicates and the solution to a problem of Mostowski
- The Diagonal Method and Hypercomputation
- New Computational Paradigms
- New Computational Paradigms
- Remarks on universal quantum computer
- Non-Turing computations via Malament--Hogarth space-times
This page was built for publication: Zeno machines and hypercomputation
