A simple and powerful approach for studying constructivity, computability, and complexity
From MaRDI portal
Publication:4594267
DOI10.1007/BFb0021094zbMath1434.03114OpenAlexW2317996543MaRDI QIDQ4594267
Publication date: 17 November 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0021094
Other constructive mathematics (03F65) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (3)
Expressing computational complexity in constructive type theory ⋮ Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines ⋮ A note on complexity measures for inductive classes in constructive type theory
This page was built for publication: A simple and powerful approach for studying constructivity, computability, and complexity
