Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Halting_problem> ?p ?o. }
Showing items 1 to 46 of
46
with 100 items per page.
- Halting_problem abstract "In computability theory, the halting problem can be stated as follows: "Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever". This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever.Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. A key part of the proof was a mathematical definition of a computer and program, which became known as a Turing machine; the halting problem is undecidable over Turing machines. It is one of the first examples of a decision problem.Jack Copeland (2004) attributes the term halting problem to Martin Davis.".
- Halting_problem wikiPageExternalLink loopsnoop.html.
- Halting_problem wikiPageExternalLink 12.
- Halting_problem wikiPageExternalLink watch?v=92WHN-pAFCs.
- Halting_problem wikiPageID "21391870".
- Halting_problem wikiPageRevisionID "605494768".
- Halting_problem hasPhotoCollection Halting_problem.
- Halting_problem subject Category:Computability_theory.
- Halting_problem subject Category:Mathematical_problems.
- Halting_problem subject Category:Theory_of_computation.
- Halting_problem type Abstraction100002137.
- Halting_problem type Attribute100024264.
- Halting_problem type Condition113920835.
- Halting_problem type Difficulty114408086.
- Halting_problem type MathematicalProblems.
- Halting_problem type Problem114410605.
- Halting_problem type State100024720.
- Halting_problem comment "In computability theory, the halting problem can be stated as follows: "Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever". This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever.Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.".
- Halting_problem label "Halteproblem".
- Halting_problem label "Halting problem".
- Halting_problem label "Problem stopu".
- Halting_problem label "Problema da parada".
- Halting_problem label "Problema de la parada".
- Halting_problem label "Problema della terminazione".
- Halting_problem label "Problème de l'arrêt".
- Halting_problem label "Stopprobleem".
- Halting_problem label "Проблема остановки".
- Halting_problem label "مسألة توقف".
- Halting_problem label "停机问题".
- Halting_problem label "停止性問題".
- Halting_problem sameAs Problém_zastavení.
- Halting_problem sameAs Halteproblem.
- Halting_problem sameAs Problema_de_la_parada.
- Halting_problem sameAs Problème_de_l'arrêt.
- Halting_problem sameAs Problema_della_terminazione.
- Halting_problem sameAs 停止性問題.
- Halting_problem sameAs 정지_문제.
- Halting_problem sameAs Stopprobleem.
- Halting_problem sameAs Problem_stopu.
- Halting_problem sameAs Problema_da_parada.
- Halting_problem sameAs m.03k9j.
- Halting_problem sameAs Q622849.
- Halting_problem sameAs Q622849.
- Halting_problem sameAs Halting_problem.
- Halting_problem wasDerivedFrom Halting_problem?oldid=605494768.
- Halting_problem isPrimaryTopicOf Halting_problem.