scientific article; zbMATH DE number 3443638

MaRDI QIDQ4769049zbMATH OpenFDO

Authors Jean-Marc Steyaert, Philippe Flajolet

Publication date 1974

Full work available at URL https://eudml.org/doc/92004

Mathematics Subject Classification ID

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

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• General Problems of Formal Grammars
• scientific article; zbMATH DE number 3247155 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• On Multi-Head Finite Automata
• On two-way multihead automata
• On unsolvability in subrecursive classes of predicates
• Program size in restricted programming languages

Cited in

(5)

• Almost every set in exponential time is P-bi-immune
• Bi-immunity over different size alphabets
• Bi-immune sets for complexity classes
• Immunity and simplicity in relativizations of probabilistic complexity classes
• Almost every set in exponential time is P-bi-immune

This page was built for publication:

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