Timeline for Practicability of enumerating all Turing machines with fewer than $s$ states to find a potential polynomial-time algorithm for subset-sum?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2023 at 2:52 | vote | accept | Soha | ||
| Dec 31, 2022 at 15:20 | answer | added | Nathaniel | timeline score: 1 | |
| S Dec 31, 2022 at 14:58 | review | First questions | |||
| Jan 1, 2023 at 2:38 | |||||
| S Dec 31, 2022 at 14:58 | history | asked | Soha | CC BY-SA 4.0 |