On the computing paradigm and computational complexity

DOI10.1007/3-540-60246-1_114zbMath1193.68116OpenAlexW1873438896MaRDI QIDQ3569001

Juris Hartmanis

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60246-1_114

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems

This page was built for publication: On the computing paradigm and computational complexity