Timeline for Distribution of the computable numbers on the real number line
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 26, 2011 at 17:38 | history | edited | JON | CC BY-SA 3.0 |
added 7 characters in body
|
| Nov 25, 2011 at 10:10 | answer | added | domotorp | timeline score: 0 | |
| Nov 24, 2011 at 20:56 | history | edited | JON | CC BY-SA 3.0 |
added 28 characters in body; edited title
|
| Nov 24, 2011 at 19:31 | answer | added | Ori Gurel-Gurevich | timeline score: 1 | |
| Nov 24, 2011 at 15:19 | history | edited | JON | CC BY-SA 3.0 |
edited title
|
| Nov 24, 2011 at 12:40 | history | edited | JON | CC BY-SA 3.0 |
edited tags; edited title
|
| Nov 24, 2011 at 12:24 | comment | added | Will Sawin | Certainly not like the normal distribution. For instance, consider the Ackermann function. $A(n,n)$ takes constant+log n bits to express in any reasonable language, so the probability of a number at least as big as $A(n,n)$ will be much higher than $e^{- A(n,n)^2}$, which is a reasonable estimate for the normal distribution. Therefore, the distribution has longer tails than the normal distribution. My guess is that for most reasonable languages, a sufficient portion of the probability mass will go off to infinity, and that most facts about the distribution will not be computable. | |
| Nov 24, 2011 at 12:17 | history | asked | JON | CC BY-SA 3.0 |