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
-
Over on Dreamwidth
I created an account on dreamwidth, and will probably do most of my infrequent posting and commenting over there. https://jwgh.dreamwidth.org
-
A customer asks
Is the attached file “normal” for what you expect to see in the \listserv\main folder?The attachment contains a list of around 4,000 files. My…
-
Podcasting notes
Hey, a public post! I figured I'd post this here, so if someone else runs into some of the same problems I did they would be able to google it and…
- Post a new comment
- 1 comment
- Post a new comment
- 1 comment
