book chapter · 1990
1-Generic Enumeration Degrees Below O e ’
Cited by 4Abstract and details only
Abstract
The index has no abstract for this paper. The publisher’s page may have one.
Cite this paper
Copestake, C. S. (1990). 1-Generic Enumeration Degrees Below O e ’. https://doi.org/10.1007/978-1-4613-0609-2_17
Copestake, C. S. “1-Generic Enumeration Degrees Below O e ’.” 1990, pp. 257–65, https://doi.org/10.1007/978-1-4613-0609-2_17.
Copestake, C. S. 1990. “1-Generic Enumeration Degrees Below O e ’.” https://doi.org/10.1007/978-1-4613-0609-2_17.
Copestake, C.S. (1990) ‘1-Generic Enumeration Degrees Below O e ’’. Available at: https://doi.org/10.1007/978-1-4613-0609-2_17.
@incollection{copestake1990generic,
title = {{1-Generic Enumeration Degrees Below O e ’}},
author = {Copestake, C. S.},
pages = {257--265},
year = {1990},
doi = {10.1007/978-1-4613-0609-2_17}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Enumeration of Recursive Sets
Yoshindo Suzuki · Journal of Symbolic Logic · 1959
Cited by 11
1-Generic Enumeration Degrees Below O e ’
C. S. Copestake · Springer eBooks · 1990
Cited by 4
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
Daniel Meister · Theory of Computing Systems · 2007
Cited by 0
Finite Generation of Recursively Enumerable Sets
Julia Robinson · Proceedings of the American Mathematical Society · 1968
Cited by 10Open access
Some representations of Diophantine sets
Raphael M. Robinson · Journal of Symbolic Logic · 1972
Cited by 9
A note on natural complete sets and Gödel numberings
J. Hartmanis · Theoretical Computer Science · 1982
Cited by 15Open access
Arithmetical representation of recursively enumerable sets
Raphael M. Robinson · Journal of Symbolic Logic · 1956
Cited by 30
On completely recursively enumerable classes and their key arrays
H. Gordon Rice · Journal of Symbolic Logic · 1956
Cited by 81