Skip to main content

All Questions

Filter by
Sorted by
Tagged with
7 votes
0 answers
471 views

Infinite time Turing machines, semi-decidable sets and descriptive set theory

Definition A set of reals $A$ is said to be ittm-eventually-semi-decidable if there is an Infinite Time Turing Machine programme $P_e$ so that $x\in A$ iff $P_e(x)$ has converged on “1” on its ...
Philip Welch's user avatar
  • 4,839