?

Log in

No account? Create an account

Previous Entry | Next Entry

"I'm the decider, and I decide what is best." - George Bush

Does this apply somehow....?
"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" - http://www.reference.com/browse/wiki/Machines_that_always_halt