In computability theory the halting problem is a decision problem which can be informally stated as follows:
Given a description of a program and a finite input, decide whether the program finishes running or will run forever, given that input.
Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. We say that the halting problem is undecidable over Turing machines.
Download ebooks on http://www.frenchtheory.com/
See that post with different algorithms in metabole
See the journal French Metablog with today different posts
Given a description of a program and a finite input, decide whether the program finishes running or will run forever, given that input.
Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. We say that the halting problem is undecidable over Turing machines.
Download ebooks on http://www.frenchtheory.com/
See that post with different algorithms in metabole
See the journal French Metablog with today different posts
