Timeline for Is this set semi-decidable? A set of all <M> that M is a TM halts on all input strings w such that w <= q(M) where q(M) is the number of states in M
Current License: CC BY-SA 4.0
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2020 at 15:55 | history | answered | Shahaf Finder | CC BY-SA 4.0 |