Timeline for When is an upper bound on the longest irreducible program outputting something computable?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2023 at 9:46 | comment | added | Gro-Tsen | @CommandMaster It's fine if a proof is a subsequence of a compute program: the only point of compute mode is to fulfill your requirement on Turing-completeness, but we don't care if compute mode programs are irreducible; what we want is to have very long irreducible programs, so we want proof mode programs not to have compute mode programs as subsequences. | |
| Dec 17, 2023 at 3:15 | comment | added | Daniel Weber | Thanks! You need proof mode programs to start with a special character, not compute mode, otherwise a proof could still be a subsequence of a compute program | |
| Dec 16, 2023 at 23:30 | history | answered | Gro-Tsen | CC BY-SA 4.0 |