Recursion theoretic properties of frequency computation and bounded queries

DOI10.1006/inco.1995.1099zbMath0836.03022OpenAlexW1989212933MaRDI QIDQ1898479

Martin Kummer, Frank Stephan

Publication date: 29 October 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1099

zbMATH Keywords

verboseness\((m,n)\)-recursive setfrequency computation

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (10)

Resource bounded frequency computations with three errors ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ Resource Bounded Frequency Computations with Three Errors ⋮ An incomplete set of shortest descriptions ⋮ On the structures inside truth-table degrees ⋮ Kolmogorov entropy in the context of computability theory ⋮ 1999 European Summer Meeting of the Association for Symbolic Logic ⋮ A structural property of regular frequency computations. ⋮ Graphs realised by r.e. equivalence relations ⋮ Classes bounded by incomplete sets

This page was built for publication: Recursion theoretic properties of frequency computation and bounded queries