[Beowulf] Win64 Clusters!!!!!!!!!!!!
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Peter St. John peter.st.john at gmail.comWed Apr 11 15:08:12 PDT 2007
- Previous message: [Beowulf] Re: debugging
- Next message: [Beowulf] Cell programming
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
My friend Landon sent me the link I needed to say "math proves that math is equivalent to programming"; it actually says something more like "there is an isomorphism between proofs of deductive logic and constructions of Lambda Calculus" but even that I'm saying badly, the link is http://en.wikipedia.org/wiki/Curry-Howard_isomorphism Gratifyingly, the intro has the phrase "Proofs are Programs" :-) On second thought my guestimate of the size of a program that might be produced from the Clasification of Finite Simple Groups is excessive. I'm thinking 100MB would be more fair order of magnitude than 1GB. I don't mean that the possible huge size of source code justifies 64 bit words, it's enough, to me, that a huge integer can fit into a register, for number theory. But yes we humans can indeed create vast grotesque edifices of scholarship without the necessity of machine generation. But the machines will, of course, win in the end :-) Peter On 4/11/07, Peter St. John <peter.st.john at gmail.com> wrote: > > Jon, > > On 4/10/07, Jon Forrest <jlforrest at berkeley.edu> wrote: > > > > > > But I stand firm on my claim that no human, or group > > of humans, can write a program that requires more than > > 32-bits of text space. > > > I like to say that proving a theorem is alot like writing a program. I > don't know about the biggest software projects, but the Classification of > Finite Simple Groups was huge; from Wiki: > "In all, the work comprises tens of thousands of pages in 500 journal > articles by some 100 authors." > My thumbnail guesstimate of how much bytes are in a typical journal page > of mathematics (maybe less than AMSTeX source, but more than 2k of plaintext > prose, because all the symbols have to be expressed as abbreivations...) > suggests that this work, done by humans, amounts to more than 4 GB. > I'm not clear, myself, about the "infinite flat address space", as I want > my data space to be a bit more structured (in my view of the C source, say) > and don't want to care about how it looks to the compiler (as long as the > compiler is happy). However, the killer app to me is what RGB mentioned; I > know and love numbers that don't fit in one 32-bit word. > Peter > > Cordially, > > -- > > Jon Forrest > > Unix Computing Support > > College of Chemistry > > 173 Tan Hall > > University of California Berkeley > > Berkeley, CA > > 94720-1460 > > 510-643-1032 > > jlforrest at berkeley.edu > > _______________________________________________ > > Beowulf mailing list, Beowulf at beowulf.org > > To change your subscription (digest mode or unsubscribe) visit > > http://www.beowulf.org/mailman/listinfo/beowulf > > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.scyld.com/pipermail/beowulf/attachments/20070411/fd3055f6/attachment.html
- Previous message: [Beowulf] Re: debugging
- Next message: [Beowulf] Cell programming
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list
