Timeline for (Very) Large numbers, Chaitin's incompletness theorem and a specific upper bound
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2023 at 0:15 | vote | accept | truebaran | ||
| Sep 15, 2023 at 0:07 | history | became hot network question | |||
| Sep 14, 2023 at 22:38 | comment | added | Joel David Hamkins | @TimothyChow Yes, sorry. The constant is the cost of translating between various formalisms. | |
| Sep 14, 2023 at 22:34 | comment | added | Timothy Chow | @JoelDavidHamkins Do you mean up to an additive constant, rather than a constant multiple? | |
| Sep 14, 2023 at 16:44 | answer | added | Joel David Hamkins | timeline score: 16 | |
| Sep 14, 2023 at 16:39 | history | edited | truebaran | CC BY-SA 4.0 |
added 291 characters in body
|
| Sep 14, 2023 at 16:30 | review | Close votes | |||
| Sep 19, 2023 at 3:08 | |||||
| Sep 14, 2023 at 16:11 | comment | added | Gro-Tsen | Possible duplicate | |
| Sep 14, 2023 at 16:11 | comment | added | Joel David Hamkins | Kolmogorov complexity is only defined at best up to a constant multiple, since it depends on the formalism of computability. | |
| Sep 14, 2023 at 16:03 | history | asked | truebaran | CC BY-SA 4.0 |