devise a finite process to determine whether the
Every indexed document
Browse the released records by type and release. Open any document to read its text and jump to the official source.
66,700 documents
I came up with the idea for the interface
including writing your code out in pencil on special paper
equating to about 10 words per day. A good typist
the productivity of a programmer can be as low as one line
“Wouldn’t it be great if my computer could write
making provision for any gibberish that might be typed
Halt cannot exist either. QED. There is no general program that will
the computer will usually run the program
there is a counting algorithm that would run every
you will generate every possible program along the
“delete every item on my hard disk.” Of course
and then stop and ring a bell if a solution is found. The Halt
the theory is disproved. This gives us a way to discover proofs of
we will ask it to try every possible index for
it will tell us if the program finds an answer. If I am trying to
I will have solved Fermat’s Last Theorem! Do you see why?
which can run any program you throw at it.
the computer reads the number and interprets it as a series
drills and saws – to fashion objects. Each machine does