Limits of computation. From a programming perspective

DOI10.1007/978-3-319-27889-6zbMath1376.68003OpenAlexW2486520545MaRDI 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

complexitycomputabilityupper-level undergraduate courseWHILE-language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Spiking neural P systems with lateral inhibition ⋮ A Survey on Analog Models of Computation

This page was built for publication: Limits of computation. From a programming perspective