⇒
⇒
The Decider
Bush is no Alan Turning
http://en.wikipedia.org/wiki/Deciderprimitive recursive functions... hate...war...greed.
"In computability theory, a machine that always halts — also called a decider (Sipser, 1996) — is any abstract machine or model of computation that, contrary to the most general Turing machines, is guaranteed to halt for any particular description and input (see halting problem)."
...
"In practice, a machine that always halts can be implemented as a programming language with restricted flow control instructions, so that no program (i.e. description) will ever cause the machine to enter an infinite loop."
...
Machines that always halt are less powerful than Turing machines, as the following theorem shows:
There are (Turing-)computable total functions that are not computable by any machine that always halts.
...(see theorem)
Despite the above theorem, it is possible to construct a machine that always halts and yet computes the majority of functions of interest (the so-called primitive recursive functions),
...
“I’m the decider” Mr. Bush said
I’m of the opinion that Bush is Halting all the time as he is guaranteed to halt for any particular description and input
“Mr President, we need more troops for Iraq invasion…”
HALT !
“Mr President, things aren’t looking good in Iraq…”
HALT !
“Mr President, we have this Hurricane and…”
HALT !
“Mr President, the constitution says…”
HALT !
and so on and so on and so on….
Kind of a variation of “Talk to the hand”.
~
