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).
'decider' is a funny word
-
unconscious or deniable = OK
I happened across this little quotation from the head of NASA a little while ago: In an interview with NPR's Steve Inskeep airing May 31, 2007 on…
-
letter from Asimov's
I'm just getting around to reading the March 2007 issue of Asimov's, which contains the following letter from a reader of an essay by Kristin…
-
T-Mobile Hotspot grumble
Every so often it becomes necessary for me to work someplace that isn't my house. These days I like to go to a Borders to do this. Border's is a…
- Post a new comment
- 1 comment
- Post a new comment
- 1 comment
