Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.1121
Title: Computability Theory. - 3. ed. -
Language: English
Authors: Zimmermann, Karl-Heinz 
Keywords: computability, recursion theory, computational complexity
Issue Date: 2013
Abstract (german): Einführung in die klassische Theorie der Berechenbarkeit und ein kurzer Abriss der Komplexitätstheorie. 3. ed.
Abstract (english): Introduction to the classical computability theory and a short presentation of the basic theory of computational complexity.
URI: http://tubdok.tub.tuhh.de/handle/11420/1123
DOI: 10.15480/882.1121
Institute: Rechnertechnologie E-13 
Type: Buch (Monographie)
Appears in Collections:Publications (tub.dok)

Files in This Item:
File Description SizeFormat
CompBookKHZ.pdf757,63 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

354
Last Week
0
Last month
5
checked on May 25, 2019

Download(s)

210
checked on May 25, 2019

Google ScholarTM

Check

Export

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