Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.1714
Fulltext available Open Access
Title: Computability theory
Language: English
Authors: Zimmermann, Karl-Heinz 
Keywords: computability;recursion theory;undecidability;word problems;complexity theory
Issue Date: 2018
Abstract (german): Die Veröffentlichung gibt eine Einführung in die Theorie der Berechenbarkeit.
Abstract (english): This publication provides an introduction to the theory of computation.
URI: http://tubdok.tub.tuhh.de/handle/11420/1717
DOI: 10.15480/882.1714
Institute: Eingebettete Systeme E-13 
Type: Buch (Monographie)
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
comptheory-khz-2018.pdfMonographie-PDF992,46 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

184
Last Week
2
Last month
19
checked on Sep 21, 2020

Download(s)

140
checked on Sep 21, 2020

Google ScholarTM

Check

Note about this record

Export

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