Questions tagged [infinite-time-computability]

3 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
1 answer

Infinite-time Turing machines and the formal Church's thesis

Infinite-time Turing machines are known to either halt or loop in countable time. In the spirit of double-negation translation, is there a statement which is: classically equivalent to this; ...
user avatar
1 vote
0 answers

A Question Regarding Productive Sets in the Koepke-Koerwien System SO (Sets of Ordinals)

In their paper "The Theory of Sets of Ordinals" (arXiv), Koepke and Koerwien propose a theory SO axiomatizing the class of sets of ordinals in a model of ZFC and show that SO and ZFC are bi-...
user avatar
0 votes
0 answers

Does the following characterization of the elements of $\mathscr P$($\omega$) fail for ITTM's?

Hartley Rogers Jr., on pg. 120 of his text, Theory of Recursive Functions and Effective Computability, presents and discusses the following characterization of the sets in $\mathscr P(\omega)$: $\...
user avatar