go ahead... be a heretic PerlMonks

### Mystic numbers (Re: the secret of PI)

by larsen (Parson)
 on May 04, 2001 at 16:39 UTC ( #77935=note: print w/replies, xml ) Need Help??

in reply to the secret of PI

If someone could be able to give a proof that \pi's digits follow a casual distribution, you could find in it every possible finite sequence of digits. Thus, you could find on \pi the source for Perl 6, all nodes of PerlMonks (even those that are not written yet) and so on...

Furthermore, such a true casual number exists: we are able to define it and we know some of its properties, but it is demonstrated that we can't compute it. This number is called \Omega, and it's defined as the probability that an Universal Turing Machine halts given random input.

\Omega has other interesting properties. If we could know \Omega we would be able to solve the halting problem for every Turing Machine, finding a solution to, for example, the Goldbach's conjecture and Collatz's game.

If you want to read more about this mystic number and related topics, visit the home page of this wise man.

Replies are listed 'Best First'.
Re: Mystic numbers (Re: the secret of PI)
by japhy (Canon) on May 04, 2001 at 16:43 UTC
I like the Infinity engine (found here). It uses the notion that:
• after one second, do X
• after half a second, do X
• after a quarter of a second, do X
• after an eight of a second, do X
• ...
That way, after 2 seconds, we have executed "X" an infinite number of times.

japhy -- Perl and Regex Hacker

This sounds like a variant on my patented Time Extensible Processor. The TEP projects your task far enough into the future so that it is done now. It has an interesting side effect, however. If the tasks ever stop running, it indicates the end of the universe. But because of how time and space work, you can simply pick up the machine and move it a few inches to the left or right to resume processing. At least, until that time/space thread ends.

--Chris

e-mail jcwren
Re (tilly) 1: Mystic numbers (Re: the secret of PI)
by tilly (Archbishop) on May 04, 2001 at 19:20 UTC
The usual name for this is a "normal number". It is unknown whether Pi is normal, but it is strongly suspected to be.

Not as if it's much consolation, but a statistical analysis shows that both pi and e1 have each digit (0..9) appear one tenth of the time. It's not a rigorous mathematical proof of normality, but it shows that such a proof shouldn't be able to be disproved, which is important in itself...

nuf evah,
jynx

Re: Mystic numbers (Re: the secret of PI)
by Anonymous Monk on Aug 19, 2003 at 23:27 UTC
Pi is
Pi is (normal)
Can you provide a proof for that?

Log In?
 Username: Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://77935]
help
Chatterbox?
 [Corion]: Hi Lady_Aleena! [Lady_Aleena]: marioroy, are you also writing a Meditation for this? choroba o/ Discipulus adds tozzetti alle mandorle to the platter on the sideboard. Lady_Aleena was checking #cbstream and saw the big announcement. [marioroy]: Tie::IxHash can be shared. Also similar modules. I cannot wait to post a solution sharing Tie::File and iterating among workers. [marioroy]: Lady_Aleena Yes, will post something with all the new features. Parallel with few lines of code. [marioroy]: Yes, will do for PM. I love PM. Lady_Aleena ponders a meditation of her own, but it would be on a far far less important topic. [marioroy]: I'm hoping to have a release in about a week's time.

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2017-05-26 08:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My favorite model of computation is ...

Results (189 votes). Check out past polls.