20 citations · 36 across the 10 of their papers we have counts for
4 papers · 2 filters
Supertask Computation
Joel David Hamkins
Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds ligh…
Infinite Time Turing Machines: Supertask Computation
Joel David Hamkins
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,…
P^f is not equal to NP^f for almost all f
Joel David Hamkins, Philip D. Welch
We discuss the question of Ralf-Dieter Schindler whether for infinite time Turing machines P^f = NP^f can be true for any function f from the reals into omega_1. We show that ``alm…
A class of strong diamond principles
Joel David Hamkins
In the context of large cardinals, the classical diamond principle Diamond_kappa is easily strengthened in natural ways. When kappa is a measurable cardinal, for example, one might…