Algorithmic information theory. Understanding computability and complexity

DOI10.1007/978-3-662-61694-9MaRDI QIDQ3299605zbMATH OpenOpenAlexFDO

Authors Kurt-Ulrich Witt, Martin Müller

Publication date 24 July 2020

Full work available at URL https://doi.org/10.1007/978-3-662-61694-9

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx) Algorithms in computer science (68Wxx)

Recommendations

• Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction
• Theoretical informatics. An extensive introduction
• Theoretical informatics.
• scientific article; zbMATH DE number 1216160
• Theoretical informatics

Cited in

(4)

• Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction
• scientific article; zbMATH DE number 5081004 (Why is no real title available?)
• scientific article; zbMATH DE number 53549 (Why is no real title available?)
• Algorithmic information theory and undecidability

This page was built for publication: Algorithmic information theory. Understanding computability and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299605)