Beeler, M., Gosper, R.W., and Schroeppel, R. HAKMEM. MIT AI Memo 239, Feb. 29, 1972. Retyped and converted to html ('Web browser format) by Henry Baker, April, 1995. PROGRAMMING HACKS ITEM 145 (Gosper): Proving that short programs are neither trivial nor exhausted yet, there is the following: 0/ TLCA 1,1(1) 1/ see below 2/ ROT 1,9 3/ JRST 0 This is a display hack (that is, it makes pretty patterns) with the low 9 bits = Y and the 9 next higher = X; also, it makes interesting, related noises with a stereo amplifier hooked to the X and Y signals.
Read full article from HAKMEM -- PROGRAMMING HACKS -- DRAFT, NOT YET PROOFED
No comments:
Post a Comment