Computability and Complexity

[Revised entry by Neil Immerman on September 2, 2015. Changes to: Main text, Bibliography, descriptiveWorld2015.jpg] A mathematical problem is computable if it can be solved in principle by a
Philosophy News image
[Revised entry by Neil Immerman on September 2, 2015. Changes to: Main text, Bibliography, descriptiveWorld2015.jpg] A mathematical problem is computable if it can be solved in principle by a computing device. Some common synonyms for "computable" are "solvable", "decidable", and "recursive". Hilbert believed that all mathematical problems were solvable, but in the 1930's Godel, Turing, and Church showed that this is not the case. There is an extensive study and classification of which mathematical...

Continue reading . . .

News source: Stanford Encyclopedia of Philosophy

blog comments powered by Disqus