This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and GApdel's Incompleteness Theorem.This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability.

Title | : | Computability |

Author | : | Nigel Cutland |

Publisher | : | Cambridge University Press - 1980-06-19 |

Continue