Toward a Theory of Enumerations

DOI10.1145/321510.321525MaRDI QIDQ5585416zbMATH OpenOpenAlexFDO

Authors P. R. Young

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321510.321525

zbMATH Keywords

constructive mathematicsrecursion theory

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Recommendations

• A note on enumerative counting
• Enumerations in computable structure theory
• Enumerations, countable structures and Turing degrees
• Constructive theory of enumerable species
• scientific article; zbMATH DE number 935530
• On the power of enumerative counting
• Fragments of the theory of the enumeration degrees
• scientific article; zbMATH DE number 3857076
• scientific article; zbMATH DE number 39343
• Definability via enumerations

Cited in

(26)

• Independence results in computer science?
• Infimums of step-counting functions of enumeration of sets
• On sets polynomially enumerable by iteration
• On the power of enumerative counting
• The complexity of total order structures
• Listing graphs that satisfy first-order sentences
• Scalability and the isomorphism problem
• Time- and tape-bounded Turing acceptors and AFLs
• The enumerability and invariance of complexity classes
• Countable Lawvere theories and computational effects
• Reverse complexity
• An Introduction to Enumeration
• ABSTRAKTE TEMPOMASZE UND SPEED‐UP‐THEOREMEA FÜR ENUMERATIONEN REKURSIV‐AUFZÄHLBARER MENGEN
• Uniform regular enumerations
• Complete enumeration: a search for wholeness
• scientific article; zbMATH DE number 4041901 (Why is no real title available?)
• Splitting theorems for speed-up related to order of enumeration
• scientific article; zbMATH DE number 1163992 (Why is no real title available?)
• scientific article; zbMATH DE number 845500 (Why is no real title available?)
• An improved generalized enumeration of substitution systems
• Speed-ups by changing the order in which sets are enumerated (preliminary version)
• On mutually coherent enumerations of countable sets
• The Enumeration Methods of Redfield
• A note on dense and nondense families of complexity classes
• Speed-Ups by changing the order in which sets are enumerated
• Computational speed-up by effective operators

This page was built for publication: Toward a Theory of Enumerations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585416)