All Questions
Tagged with constructibility infinite-time-turing-machine
1 question
0
votes
0
answers
195
views
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)$:
$\...
- 13.4k