Keyword

computably enumerable sets

Description: Sets whose members can be listed by an algorithm, possibly without the algorithm ever confirming that the list is complete.

Primary topic: Computability, Logic, AI Algorithms (79%)

Wikidata ID: wiki/Q676835

OpenAlex ID: keywords/computably-enumerable-sets

Computing with Membranes

2000 · Gheorghe Păun · Journal of Computer and System Sciences · 2,285

PDF

Theory of Recursive Functions and Effective Computability

1987 · Jr. Hartley Rogers · CERN Document Server (European Organization for Nuclear Research) · 1,987

Recursively enumerable sets and degrees

1978 · Robert I. Soare · Bulletin of the American Mathematical Society · 1,540

PDF

Recursively Enumerable Sets and Degrees

1987 · Robert I. Soare · Perspectives in mathematical logic · 1,339

Alternation

1981 · Ashok K. Chandra, Dexter C. Kozen, et al. · Journal of the ACM · 1,221

PDF

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

1989 · Lenore Blum, Mike Shub, et al. · Bulletin of the American Mathematical Society · 1,056

PDF

On the Computational Complexity of Algorithms

1965 · J. Hartmanis, R. E. Stearns · Transactions of the American Mathematical Society · 1,009

PDF

Recursively enumerable sets of positive integers and their decision problems

1944 · Emil L. Post · Bulletin of the American Mathematical Society · 873

PDF

Classical Recursion Theory

1999 · Studies in logic and the foundations of mathematics · 871

Classes of Recursively Enumerable Sets and Their Decision Problems

1953 · H. G. Rice · Transactions of the American Mathematical Society · 865

PDF

Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

1987 · Robert I. Soare · 354

Π⁰₁ classes and degrees of theories

1972 · Carl G. Jockusch, Robert I. Soare · Transactions of the American Mathematical Society · 353

Enumerable Sets Are Diophantine

2003 · Ju. V. MATIJASEVIČ · CO-PUBLISHED WITH SINGAPORE UNIVERSITY PRESS eBooks · 351

Computability: An Introduction to Recursive Function Theory

1980 · Nigel J. Cutland · Medical Entomology and Zoology · 332

On axiomatizability within a system

1953 · William Craig · Journal of Symbolic Logic · 311

Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (solution of Post's Problem, 1944)

1957 · Richard M. Friedberg · Proceedings of the National Academy of Sciences · 295

Subgroups of finitely presented groups

1961 · Graham Higman · Proceedings of the Royal Society of London A Mathematical and Physical Sciences · 268

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

1958 · Richard M. Friedberg · Journal of Symbolic Logic · 247

Reversal-bounded multipushdown machines

1974 · Brenda S. Baker, Ronald V. Book · Journal of Computer and System Sciences · 234

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

1966 · Donald A. Martin · Mathematical logic quarterly · 211

Computability

1980 · Nigel Cutland · Cambridge University Press eBooks · 206

Recursively enumerable sets and degrees

1988 · Gian-Carlo Rota · Advances in Mathematics · 199

The dimensions of individual strings and sequences

2003 · Jack H. Lutz · Information and Computation · 197

PDF

Lowness properties and randomness

2004 · André Nies · Advances in Mathematics · 189

PDF

Computability on subsets of metric spaces

2003 · Vasco Brattka, Gero Presser · Theoretical Computer Science · 160

Works count: 2,804

Citation count: 36,550