Silliness: Gödel-Numbering Drawdowns
Sample pages
Page 1, at reduced quality. Open the document to read every page in full.
A short, self-described "silly" article by Ralph Griswold on assigning a unique number to every drawdown using Gödel numbering. It explains prime factorization and the fundamental theorem of arithmetic, then encodes a 10-by-7 drawdown as an array of 0s and 1s and as exponents of successive primes, with the width and height stored as the powers of 2 and 3. A sidebar covers Kurt Gödel and his incompleteness theorem, and the article closes by noting that simple base-2 encoding gives a much smaller number.
- Type
- Web Doc
- Date
- April 24, 2002
- Language
- English
- Pages
- 2
- Archive notes
- Last revised August 11, 2004
(A free account is all you need)
From Ralph Griswold's Digital Archive, delivered by the University of Arizona.
Have missing pages or a better copy of this document, or another document to share? Contributing documents »