Theodore Slaman's user avatar
Theodore Slaman's user avatar
Theodore Slaman's user avatar
Theodore Slaman
  • Member for 11 years, 2 months
  • Last seen this week
23 votes
Accepted

Looking for a copy of Leo Harrington's unpublished notes on the first nonprojectible ordinal

11 votes

If an oracle Turing machine halts with every infinite arithmetic oracle, can it fail to halt with some non-arithmetic oracle?

10 votes

Ideals generated by Turing independent sets

9 votes

Three old questions on the Sacks forcing

9 votes
Accepted

Are there two computable binary trees such that each has a branch not computing any branch through the other?

8 votes

Topological tameness beyond the Gandy-Harrington topology

8 votes
Accepted

End-extension which Mostowski collapses a fake well ordering

7 votes
Accepted

Countable admissible ordinals

7 votes
Accepted

How similar are the c.e. degrees and the CEA(Cohen) degrees?

7 votes
Accepted

Does forcing with recursively pointed perfect trees add a Turing degree that is minimal over $V$?

7 votes

Join Density in R.E. Degrees: Are there r.e. B, C with all r.e. X below B computable or C join X computes B

7 votes
Accepted

Given B,C incomplete, incomparable r.e. sets must C compute low r.e. set avoiding cone below B? (ADDED: Uniformly?)

5 votes

Stronger exact pairs

5 votes
Accepted

Cupping and capping for 0’ relative to a recursively enumerable set

5 votes
Accepted

Is there a $\Delta^0_2$ real with "easy total computability problem"?

4 votes
Accepted

Splitting $\Pi^0_2$ Singletons?

3 votes
Accepted

Does $A \leq_{\alpha} B$ imply $A \leq_{\beta} B$ for admissible ordinals $\alpha < \beta$?

2 votes

Undecidable set of problems

0 votes

Existence of an $\alpha$-regular measure with positive measure on a binary digits do not have a limiting frequency