Editing List of undecidable problems (section)

==Bibliography==
* {{cite book | last = Brookshear | first = J. Glenn | title = Theory of Computation: Formal Languages, Automata, and Complexity | year = 1989 | publisher = Benjamin/Cummings Publishing Company, Inc. | location = Redwood City, California}} 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.
* {{cite report | last = Halava | first = Vesa | title = Decidable and undecidable problems in matrix theory | year = 1997 | type = TUCS technical report | volume = 127 | publisher = Turku Centre for Computer Science | citeseerx = 10.1.1.31.5792 }}
* {{cite book | last = Moret | first = B. M. E. | title = Algorithms from P to NP, volume 1 - Design and Efficiency | year = 1991 | publisher = Benjamin/Cummings Publishing Company, Inc. | location = Redwood City, California |author2=H. D. Shapiro }} Discusses intractability of problems with algorithms having exponential performance in Chapter 2, "Mathematical techniques for the analysis of algorithms."
* {{cite book | last = Weinberger | first = Shmuel | title = Computers, rigidity, and moduli | year = 2005 | publisher = Princeton University Press | location = Princeton, NJ}} Discusses undecidability of the word problem for groups, and of various problems in topology.