Splitting theorems for speed-up related to order of enumeration

DOI10.2307/2273375zbMath0503.03016OpenAlexW2065827458MaRDI QIDQ3968913

Andrew M. C. Dawes

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273375

zbMATH Keywords

complexity measureinfinite recursively enumerable set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On orders of translations and enumerations
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Toward a Theory of Enumerations
• Speed-Ups by changing the order in which sets are enumerated

This page was built for publication: Splitting theorems for speed-up related to order of enumeration