Keyword

recursive sets

Description: In computability theory, recursive sets are sets for which an algorithm always terminates and decides whether any given element belongs to the set.
Wikidata ID: wiki/Q877945
OpenAlex ID: keywords/recursive-sets
1975 · Theodore Baker, John Gill, et al. · SIAM Journal on Computing · 940
1980 · Nigel Cutland · Cambridge University Press eBooks · 556
1965 · Hilary Putnam · Journal of Symbolic Logic · 362
1978 · S.A. Greibach · Theoretical Computer Science · 304
2008 · Michael Hochman · Inventiones mathematicae · 176
1967 · Seymour Ginsburg, Sheila A. Greibach, et al. · Journal of the ACM · 152
1970 · R.B. Jensen, R.M. Solovay · Studies in logic and the foundations of mathematics · 136
1982 · Timothy J Long · Theoretical Computer Science · 103
1960 · M. O. Rabin · CTIT technical reports series · 97
1977 · Stephen G. Simpson · Studies in logic and the foundations of mathematics · 91
1958 · J. C. E. Dekker, J. Myhill · Canadian Journal of Mathematics · 91
1968 · J. Hartmanis · Journal of the ACM · 87
1987 · Robert A. di Paola, Alex Heller · Journal of Symbolic Logic · 66
1979 · Robert J. Matthews · Synthese · 59
1958 · J. C. E. Dekker, J. Myhill · Transactions of the American Mathematical Society · 59
1988 · M V Sapir · Mathematics of the USSR-Sbornik · 47
1968 · J. Hartmanis · Journal of Computer and System Sciences · 44
2009 · Zvonko Iljazović · JUCS - Journal of Universal Computer Science · 40
1982 · Philip S. Mulry · Journal of Pure and Applied Algebra · 40
1969 · Carl G. Jockusch · Journal of Symbolic Logic · 40
1961 · Michael Arbib · Journal of the ACM · 34
1971 · Stal O. AANDERAA · Studies in logic and the foundations of mathematics · 31
1956 · Norman Shapiro · Transactions of the American Mathematical Society · 31
1970 · A. H. Lachlan · Canadian Journal of Mathematics · 30
2018 · Luca Lombardini · Advanced Nonlinear Studies · 29
Works count: 202
Citation count: 4,384
Year
Topic
Type