[176903] |

Title: Computability Theory. |

Written by: Karl-Heinz Zimmermann |

in: July (2013). |

Volume: Number: |

on pages: |

Chapter: |

Editor: |

Publisher: Hamburg University of Technology: |

Series: 20130723-computability-theory-zimmermann.pdf |

Address: |

Edition: 3. |

ISBN: 10.15480/882.1121 |

how published: 13-60 Zimm13 TUBdok |

Organization: |

School: |

Institution: |

Type: |

DOI: |

URL: |

ARXIVID: |

PMID: |

**Note: **khzimmermann, AEG

**Abstract: **This book is a development of class notes for a two-hour lecture including a one-hour lab held for second-year Bachelor students of Computer Science at the Hamburg University of Technology during the last four years. The course aims to present the basic results of computability theory, including mathematical models of computability, primitive recursive and partial recursive functions, Ackermann's function, Gödel numbering, universal functions, smn theorem, Kleene's normal form, undecidable sets, theorems of Rice, and word problems. The manuscript has partly grown out of notes taken by the author during his studies at the University of Erlangen-Nuremberg.<br /> In the second edition, 2012, minor changes were made. In particular, the section on Gödel numbering has been rewritten and a glossary of terms has been added. In the third edition, 2013, the eight chapters on computability theory were complemented by a short introduction to computational complexity theory. The added chapter provides a brief presentation of the central open question in complexity theory which is one of the millenium price problems in mathematics asking roughly whether each problem whose solution can be verified in polynomial time can also be solved in polynomial time. The chapter includes the well-known result of Stephen Cook and Leonid Lewin that the satisfiabilty problem is NP-complete and also its proof from scratch.