Limits of computation. From a programming perspective

DOI10.1007/978-3-319-27889-6zbMath1376.68003MaRDI QIDQ518688

Bernhard Reus

Publication date: 29 March 2017

Published in: Undergraduate Topics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27889-6

zbMATH Keywords

complexity; computability; upper-level undergraduate course; WHILE-language

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

68Q12: Quantum algorithms and complexity in the theory of computing