Classic text considers general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
CITATION STYLE
Stob, M., & Davis, M. (1986). Computability and Unsolvability. The American Mathematical Monthly, 93(1), 69. https://doi.org/10.2307/2322561
Mendeley helps you to discover research relevant for your work.