# Questions tagged [infinite-time-computability]

The infinite-time-computability tag has no usage guidance.

4
questions

**5**

votes

**1**answer

363 views

### 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; ...

**5**

votes

**1**answer

426 views

### On a characterization of the recursively inaccessible ordinals

For a given set of numbers $A$, let $O^A$ be the hyperjump of $A$. It is possible to iterate inductively the hyperjump of a set, through the computable ordinals, in a way that the $\alpha$-th ...

**1**

vote

**0**answers

124 views

### 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-...

**7**

votes

**1**answer

331 views

### A Question Regarding the Relation Between 0-sharp and Koepke's Bounded Truth Predicate.

In Jech's SET THEORY (a very early edition to which I have access), it is shown that the existence of 0-sharp implies the existence of a truth definition for the constructible universe L. Does the ...