|
Halting problem - Wikipedia, the free encyclopedia (4381 words) |
 | One such consequence of the halting problem's undecidability is that there cannot be a general algorithm that decides whether a given statement about natural numbers is true or not. |
| Yet another, quite amazing, consequence of the undecidability of the halting problem is Rice's theorem which states that the truth of any non-trivial statement about the function that is defined by an algorithm is undecidable. |
| The undecidability of the halting problem relies on the fact that algorithms are assumed to have potentially infinite storage: at any one time they can only store finitely many things, but they can always store more and they never run out of memory. |
| Undecidable - Wikipedia, the free encyclopedia (96 words) |
| A decision problem is undecidable if there is no known algorithm that decides it. |
| "Undecidable" is sometimes used as a synonym of "independent". |
| This is a disambiguation page: a list of articles associated with the same title. |
Feeds |
Contact