Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.1247
Fulltext available Open Access
Title: Computability Theory
Language: English
Authors: Zimmermann, Karl-Heinz 
Keywords: Computability, recursion theory, Turing machine, undecidability, word problems, complexity classes
Issue Date: 22-Jul-2015
Abstract (german): In diesem Buch wird eine kurze Einführung in die mathematische Theorie der Berechenbarkeit gegeben. Ein weiteres Kapitel beschäftigt sich mit den Komplexitätsklassen P und NP.
Abstract (english): In this book a short introduction to the mathematical theory of computability is given. An additional chapter introduces the complexity classes P and NP.
URI: http://tubdok.tub.tuhh.de/handle/11420/1250
DOI: 10.15480/882.1247
Institute: Rechnertechnologie E-13 
Type: Buch (Monographie)
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
book.pdf795,38 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

322
Last Week
3
Last month
0
checked on Oct 29, 2020

Download(s)

958
checked on Oct 29, 2020

Google ScholarTM

Check

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.