A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
From MaRDI portal
Publication:5341752
DOI10.1002/malq.19640100802zbMath0132.24703OpenAlexW2009999704MaRDI QIDQ5341752
William Alvin Howard, Marian Boykan Pour-El
Publication date: 1964
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19640100802
Related Items (7)
On injective enumerability of recursively enumerable classes of cofinite sets ⋮ A Theorem on Recursively Enumerable Classes and Splinters ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Some effectively infinite classes of enumerations ⋮ Discrete families of recursive functions and index sets ⋮ Computable single-valued numerations ⋮ The synthesis of language learners.
This page was built for publication: A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
