Search results

Page title matches

• Halting problem
  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 (988 words) - 00:43, 6 February 2010
• Halting Problem
  #Redirect [[Halting problem]]
  29 bytes (3 words) - 06:46, 4 June 2008
• Halting problem/Definition
  134 bytes (18 words) - 11:33, 15 September 2009
• Halting problem/Approval
  12 bytes (1 word) - 23:12, 4 March 2008
• Halting problem/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Halting problem]]. Needs checking by a human.
  661 bytes (87 words) - 17:04, 11 January 2010
• Halting problem/External Links
  101 bytes (13 words) - 06:05, 8 October 2010

Page text matches

• Halting Problem
  #Redirect [[Halting problem]]
  29 bytes (3 words) - 06:46, 4 June 2008
• Optimization (computer science)
  ...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
• Lambda calculus/Related Articles
  {{r|Halting problem}}
  91 bytes (11 words) - 13:19, 1 February 2009
• Cantor's diagonal argument/Related Articles
  {{r|Halting problem}}
  307 bytes (44 words) - 16:27, 26 July 2008
• Register allocation
  ...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
• Kurt Gödel/Related Articles
  {{r|Halting problem}}
  589 bytes (80 words) - 17:55, 11 January 2010
• Halting problem
  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 (988 words) - 00:43, 6 February 2010
• Alan Turing/Related Articles
  {{r|Halting problem}}
  754 bytes (103 words) - 14:41, 18 March 2024
• Halting problem/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Halting problem]]. Needs checking by a human.
  661 bytes (87 words) - 17:04, 11 January 2010
• Computer program/Related Articles
  {{r|Halting problem}}
  934 bytes (121 words) - 15:37, 11 January 2010
• Register allocation by graph coloring
  ...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
  9 KB (1,338 words) - 10:00, 16 July 2013
• Lambda calculus
  ...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 (449 words) - 15:23, 12 August 2008
• Computer/Related Articles
  {{r|Halting problem}}
  3 KB (441 words) - 12:55, 13 November 2014
• Turing Machine
  Turing invented the machine in order to solve the [[halting problem]] and it is widely used in theoretical computer science because its simplic
  3 KB (492 words) - 09:10, 22 May 2011
• Cantor's diagonal argument
  ...perhaps its most well known application is the negative solution to the [[halting problem]].
  4 KB (745 words) - 23:17, 25 October 2013
• Graph coloring
  ...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
  14 KB (2,315 words) - 00:35, 9 February 2010
• Alan Turing
  ...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 Theo
  5 KB (782 words) - 05:57, 8 April 2024
• Theory (mathematics)
  ...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-replication
  34 KB (5,174 words) - 21:32, 25 October 2013
• Archive:Citizen/V1-N3
  * [[Halting problem]]
  21 KB (2,958 words) - 05:06, 8 March 2024
• CZ Talk:Article mechanics
  ...same level as what he's reading. Taking Turing again, the article on the [[Halting problem]] needs a link to T's paper, but few readers will actually need the origina
  66 KB (10,879 words) - 17:02, 5 March 2024