On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine

DOI10.2307/2160913zbMath0806.03028OpenAlexW4248406357MaRDI QIDQ4318441

Kostas Skandalis

Publication date: 16 February 1995

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2160913

zbMATH Keywords

recursively enumerable setspseudo-diophantine

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Abstract and axiomatic computability and recursion theory (03D75)

This page was built for publication: On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine