Hyperloops Do Not Threaten the Notion of an Effective Procedure

DOI10.1007/978-3-642-03073-4_8zbMath1268.03046OpenAlexW199833979MaRDI QIDQ3576039

Tim Button

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: http://osf.io/pqd8p/

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Cites Work

• Unnamed Item
• Unnamed Item
• A new problem for rule following
• Relativistic computers and the Turing barrier
• An Introduction to Gödel's Theorems
• Building Infinite Machines
• Infinite time Turing machines
• Deciding Arithmetic Using SAD Computers
• The Extent of Computation in Malament–Hogarth Spacetimes
• SAD Computers and Two Versions of the Church–Turing Thesis
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: Hyperloops Do Not Threaten the Notion of an Effective Procedure