Timeline for Language of TMs that accept some x in less than 50 steps. Is it in co-RE?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2017 at 10:59 | comment | added | jon | It's a mapping reduction, not a turing reduction | |
| Jan 14, 2017 at 16:19 | comment | added | David Richerby | This is a reduction from L to ATM (when you say "run w om M and, if M accepts, ..." I think you mean "uses the oracle for ATM to determine in a single step whether M accepts w". You need to explain how showing a reduction from L to ATM addresses the question of whether L is co-RE. | |
| Jan 14, 2017 at 14:34 | history | edited | jon | CC BY-SA 3.0 |
edited body
|
| Jan 14, 2017 at 14:11 | review | First posts | |||
| Jan 14, 2017 at 16:19 | |||||
| Jan 14, 2017 at 14:08 | history | answered | jon | CC BY-SA 3.0 |