Frequency computations and the cardinality theorem

DOI10.2307/2275300zbMath0763.03024OpenAlexW2068666632MaRDI QIDQ4032651

No author found.

Publication date: 1 April 1993

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

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

zbMATH Keywords

surveydecidabilityrecursive functionsfrequency computationbounded query computations

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

The power of frequency computation, On the Influence of Technology on Learning Processes, Resource bounded frequency computations with three errors, Enumerations including laconic enumerators, Structured Frequency Algorithms, A proof of Beigel's cardinality conjecture, Frequency computation and bounded queries, Weak cardinality theorems, Index Sets and Universal Numberings, Index sets and universal numberings

Cites Work

• A cardinality version of Beigel's nonspeedup theorem