If you want to produce strings from numbers, I suggest my Math::Fleximal. Converting your number above to base 26 I get:

nuthtyhtdpfinhyipsbruqexifcqhatvnvfllozvphwvlwkzxxuxkagd
kcrengspkehnshjswoqcsdydebhlbghtoqafhokqdrotmpocphfgapwe
cczcygnghilplmfwzjznumybripnuvwxpagbmsoqcnnriefashyptlrx
qfvpecmipsyhbxfljkzdidhufjqsojagahyapmdjatgkqgeckodwmbon
vhiqadxvebworuudzozsjylfomchobtzvabyqywpfnqipcxvhkmxamgh
dnkisvqdobkpzdfsnlenltqowomyrlhkopznhnevjiofdmacfxsaksps
ipbmmatuajuowctcazksqinescosmyzxiuoeiqrzjqlpfmhtrhxdnift
barmdhnbaoalntlmmwjsmbbrgrgsxmdpbhaoufzeybplyxtcfhmwpjzw
naizhhlxeifszkghtkrmxxrnlajicomjqcpdmbstvlwupcnktniudxfu
vfunpgzbyehqqxshxhvvyupcfcoriuwfmpnmsxszrzcpmxplbbbxtsfs
pojbxwuzbfpsuryipvdbzpmftphgocieonbquqvaeolvmylnclyvqdwq
ltduvpefwyyqxszxwzfhytwxxxrueadyzicbkqgylvcdflfcczfmhutc
oxxsjrjuaxlymoxymbnchxggdcdvvjitsixrlbgyvxnfinmsbqanqzai
voycbrdcchgjrutrjkxhvejcnpndabcymnjbkmvhatgpcxyjmzjhkzuq
hbqefnxzpwkasejgfpolraoomracqcxjdgoxrkuoelaurwddjfwmcplp
vbuljaeqanykvdwqdzjtgylngbijslkcfwyvivzjptqxezsnvlubmsoa
olewkuutumtjnwgnwckwclfmvlgyuiaovsewgpkbekiycwkqpucgfskt
srucfnvzcibnktrmlzxrbndzmgswjyonefknoyeozkkxhlcwfzrzwahb
cehvothdpypfswolmfmhciidirmfyowrbhonlgyjhbhwssthtapcetme
afyvghadstgjdvsdfbibwfqqhroohwmlnzlfsgboszdmjqztdddngglo
bzkqpxeghfehewdujftoanolymtbizwpodntfzqbvdlkwifwknewcguf
joudwcrccsholumyfyuatiqgoctnsdmisrsoyausrjeiybrmnzpqyrfw
awaknonguxbtrnfrkdmsghxialplxodcucacrsjfazraegjkljnicpvc
uqdouphyyrurpluhgsbwugcnijymtvvbwtnhbvbxaeudqbyuiwarxcln
pollepbtchkiatczhtigbakxigykqiqciuglvjcpknrbkhyhrlgtlhwz
kgifinjygwtwhp
[download]

Of course you will not hit many words there. But if you pass the input in as data for various "random text" algorithms you might even get out something interesting.

Using your excellent Math::Fleximal and a conversion of the 5000 first digits '0'..'9'->'a'..'z'
I got several words (by matching them with my /usr/dict/words file)
If I keep only the words with more than 3 char, I got :

'buys'
'coin'
'dull'
'fats'
'feet'
'pots'
'test'
'tint'
'warn'
'warp'
'went'

And last but not the least 'monk' !


"Only Bad Coders Badly Code In Perl" (OBC2IP)

Let's see, in this set I see 'kde', 'midi', 'die', 'leg', 'fed', 'feed', 'egg', 'heh', and 'deem'. Make of it what you will :)
Update: Upon another look, I also see 'keg', 'lid', 'fee', 'gig', 'gif', 'dig', 'film', 'hill', 'hid', 'DJ', 'led', 'hem', and 'gem'.

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.

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

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 e¹ 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

Pi is

Pi is (normal)

Can you provide a proof for that?