Supertask computation

  • Joel David Hamkins
Part of the Trends in Logic book series (TREN, volume 23)

Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.


Turing Machine Input Tape Halting Problem Quantum Turing Machine Oracle Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Joel David Hamkins
    • 1
  1. 1.Mathematics ProgramThe Graduate Center of The City University of New YorkNew YorkUSA

Personalised recommendations