Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
Infinite Time Turing Machines: Supertask Computation
Joel David Hamkins
Minds and Machines, vol. 12, no. 4, pp. 521--539, 2002. (special issue devoted to hypercomputation)
arXiv: math/0212047v1 (math.LO)
25 pages. This is an expository account of infinite time Turing machines for a philosophical audience
Licence : non indiquée (tous droits réservés)
Résumé : 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.
Soumis à arXiv le 03 Déc. 2002