Questions tagged [infinite-time-computability]

Filter by
Sorted by
Tagged with
2 votes
2 answers
543 views

Are ITTM's necessary to compute Turing's "computable numbers" and what does that mean for ordinary recursion theory?

In his celebrated paper, "On Computable Numbers, With An Application To the Entscheidungsproblem", Turing defines a "computable number" as follows: The "computable" ...
Thomas Benjamin's user avatar