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
• Talk:Halting problem
  Is 'Halting Problem' always with a capital P? Or can one write 'halting problem'? I ask because if the former the article needs to be moved accordingly. [[ :But the Wikipedia article has 'halting problem' throughout. [[User:Ro Thorpe|Ro Thorpe]] 14:07, 11 March 2008 (CDT)
  754 bytes (115 words) - 16:11, 12 March 2008
• 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
• Template:Halting problem/Metadata
  | pagename = Halting problem | abc = Halting problem
  925 bytes (99 words) - 08:32, 15 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
• Halting problem/External Links
  101 bytes (13 words) - 06:05, 8 October 2010

Page text matches

• Talk:Halting problem
  Is 'Halting Problem' always with a capital P? Or can one write 'halting problem'? I ask because if the former the article needs to be moved accordingly. [[ :But the Wikipedia article has 'halting problem' throughout. [[User:Ro Thorpe|Ro Thorpe]] 14:07, 11 March 2008 (CDT)
  754 bytes (115 words) - 16:11, 12 March 2008
• Halting Problem
  #Redirect [[Halting problem]]
  29 bytes (3 words) - 06:46, 4 June 2008
• Template:Halting problem/Metadata
  | pagename = Halting problem | abc = Halting problem
  925 bytes (99 words) - 08:32, 15 March 2024
• 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
• Talk:Kurt Gödel
  ...plications (computers), but also the whole computable numbers thing, the [[halting problem]], yadda-yadda.
  1 KB (193 words) - 10:31, 4 June 2008
• User talk:Christopher J. Reiss
  I had a look at [[Halting problem]], and it's not too bad, but I felt it could use a bit more explanation, wh ...he groundwork for a self-referential paradox under the assumption that the Halting Problem is solvable.
  7 KB (1,149 words) - 14:28, 22 September 2008
• 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
• Talk:Computers Workgroup/Archive1
  :*[[Halting problem]]
  3 KB (467 words) - 00:52, 28 August 2007