New Computational Paradigms

DOI10.1007/B136981zbMath1115.03042OpenAlexW2278484831MaRDI QIDQ5717051

Ang Sheng Li

Publication date: 11 January 2006

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

Full work available at URL: https://doi.org/10.1007/b136981

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (2)

Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

This page was built for publication: New Computational Paradigms