Zur Programmkomplexität Rekursiv Aufzählbarer Mengen

DOI10.1002/malq.19760220132zbMath0359.02036OpenAlexW2116994680MaRDI QIDQ4132508

Hans-Dietrich Hecker

Publication date: 1976

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19760220132

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursively (computably) enumerable sets and degrees (03D25)

This page was built for publication: Zur Programmkomplexität Rekursiv Aufzählbarer Mengen