Halting Problem

Frederic P. Miller

ISBN 10: 6130821271 / ISBN 13: 9786130821272

Published by Alphascript Publishing, 2010

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will 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. We say that the halting problem is undecidable over Turing machines. B. Jack Copeland attributes the actual term halting problem to Martin Davis. 88 pp. Englisch.

Seller Inventory # 9786130821272

Bibliographic Details

• Title: Halting Problem
• Publisher: Alphascript Publishing
• Publication Date: 2010
• Language: English
• ISBN 10: 6130821271
• ISBN 13: 9786130821272
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will 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. We say that the halting problem is undecidable over Turing machines. B. Jack Copeland attributes the actual term halting problem to Martin Davis.