On completely recursively enumerable classes and their key arrays

DOI10.2307/2269105zbMath0072.00504OpenAlexW2142539551MaRDI QIDQ3237143

No author found.

Publication date: 1956

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (10)

On learning of functions refutably. ⋮ Generalization versus classification ⋮ Recursive equivalence types and combinatorial functions ⋮ Lower bounds and the hardness of counting properties ⋮ Certain properties of Post enumeration retracts ⋮ Complexity classes of partial recursive functions ⋮ Recursively enumerable sets and degrees ⋮ Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) ⋮ A second step towards complexity-theoretic analogs of Rice's Theorem ⋮ Some Theorems on Classes of Recursively Enumerable Sets

This page was built for publication: On completely recursively enumerable classes and their key arrays