List Of Undecidable Problems Article Index for
List Of
Website Links For
List
 

Information About

List Of Undecidable Problems





PROBLEMS RELATED TO ABSTRACT MACHINE S


  • The Halting Problem (determining whether a specified machine halts or runs forever).

  • The Busy Beaver problem (determining the length of the longest halting computation among machines of a specified size).

  • Rice's Theorem states that for all non-trivial properties of partial functions, it is undecidable whether a machine computes a partial function with that property.



OTHER PROBLEMS




PARTIAL BIBLIOGRAPHY


1 Appendix C includes impossibility of algorithms deciding if a grammar contains ambiguities, and impossibility of verifying program correctness by an algorithm as example of Halting Problem.

2 Discusses intractability of problems with algorithms having exponential performance in Chapter 2, "Mathematical techniques for the analysis of algorithms."