Activity for user53100
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #280348 |
https://math.stackexchange.com/a/1942585 has an answer (answering in the affirmative), I'm not whether it is worth posting this as a separate answer here. (more) |
— | over 5 years ago |
| Edit | Post #278140 | Initial revision | — | almost 6 years ago |
| Question | — |
Computational hardness of the uniform halting problem How hard is the decision-problem of a plain Turing Machine halting on all inputs? I'm not sure of the terminology, but by "hard" I mean its location on the arithmetical hierarchy. It can be seen that a TM with a Halt-0 oracle (an oracle that can determine whether a plain TM halts) can co-decid... (more) |
— | almost 6 years ago |