Search results
Jump to navigation
Jump to search
Page title matches
- The '''Halting Problem''' poses a particular limited question about the predictability of the futu ...imits had been discovered to the power of formal, axiomatic reasoning. The Halting Problem can be viewed as a variant of this result in the field of [[computation]];6 KB (992 words) - 12:00, 25 August 2024
- #Redirect [[Halting problem]]29 bytes (3 words) - 06:46, 4 June 2008
- 12 bytes (1 word) - 23:12, 4 March 2008
- 134 bytes (18 words) - 11:33, 15 September 2009
- Auto-populated based on [[Special:WhatLinksHere/Halting problem]]. Needs checking by a human.795 bytes (105 words) - 12:00, 25 August 2024
- 101 bytes (13 words) - 06:05, 8 October 2010
Page text matches
- #Redirect [[Halting problem]]29 bytes (3 words) - 06:46, 4 June 2008
- ...consumption, etc). More formally, equivalent is defined so that for all [[halting problem|halting]] inputs to P, P' will produce the same outputs.562 bytes (83 words) - 09:13, 12 November 2007
- ...s possible to determine if two variables interfere (a consequence of the [[halting problem]]), and thus a compiler must act conservatively and assume that they do int * [[halting problem]]2 KB (347 words) - 00:34, 9 February 2010
- {{r|Halting problem}}232 bytes (28 words) - 17:00, 9 September 2024
- {{r|Halting problem}}448 bytes (60 words) - 17:00, 24 July 2024
- The '''Halting Problem''' poses a particular limited question about the predictability of the futu ...imits had been discovered to the power of formal, axiomatic reasoning. The Halting Problem can be viewed as a variant of this result in the field of [[computation]];6 KB (992 words) - 12:00, 25 August 2024
- {{r|Halting problem}}764 bytes (100 words) - 07:00, 9 September 2024
- {{r|Halting problem}}573 bytes (73 words) - 14:54, 5 July 2024
- Auto-populated based on [[Special:WhatLinksHere/Halting problem]]. Needs checking by a human.795 bytes (105 words) - 12:00, 25 August 2024
- {{r|Halting problem}}937 bytes (129 words) - 17:00, 7 July 2024
- {{r|Halting problem}}1 KB (141 words) - 17:01, 31 July 2024
- ...s possible to determine if two variables interfere (a consequence of the [[halting problem]]), and thus a compiler must act conservatively and assume that they do int9 KB (1,338 words) - 10:00, 16 July 2013
- ...ans. Perhaps most famously, it was used to give a negative answer to the Halting Problem in the [[Alonzo Church|Church]]-[[Alan Turing|Turing]] Thesis.3 KB (453 words) - 17:00, 9 September 2024
- Turing invented the machine in order to solve the [[halting problem]] and it is widely used in theoretical computer science because its simplic3 KB (492 words) - 09:10, 22 May 2011
- {{r|Halting problem}}3 KB (468 words) - 10:21, 14 September 2024
- ...perhaps its most well known application is the negative solution to the [[halting problem]].4 KB (749 words) - 17:00, 24 July 2024
- ...s possible to determine if two variables interfere (a consequence of the [[halting problem]]), and thus a compiler must act conservatively and assume that they do int14 KB (2,319 words) - 12:01, 23 August 2024
- ...f a computing system that is still widely used, and used it to solve the [[halting problem]], the computer science analogue of [[Kurt Gödel]]'s [[Incompleteness Theo5 KB (786 words) - 17:00, 7 July 2024
- ...her a given machine will eventually halt, or will run forever (so-called [[halting problem]]). To this end it runs the theorem-generating algorithm until either the s ...grams, so-called quine programs, can generate their own texts. (See also [[halting problem]].) It may seem to be a trick, but in fact it is a form of self-replication34 KB (5,174 words) - 21:32, 25 October 2013
- * [[Halting problem]]21 KB (2,958 words) - 05:06, 8 March 2024