Infinitely‐Often Autoreducible Sets
DOI10.1137/S0097539704441630zbMATH Open1149.03030OpenAlexW1977738917MaRDI QIDQ3446809FDOQ3446809
Authors: Richard Beigel, Lance Fortnow, Frank Stephan
Publication date: 26 June 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704441630
Recommendations
computational complexityalgorithmic randomnessHausdorff-dimensionautoreducible setsexponential-time computable setsinfinitely-often autoreducible sets
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (3)
This page was built for publication: Infinitely‐Often Autoreducible Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3446809)