Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > BLUM COMPLEXITY:
Reports tagged with blum complexity:
TR21-134 | 19th August 2021
Siddharth Bhaskar

#### A refinement of the Meyer-McCreight Union Theorem

For a function $t : 2^\star \to 1^\star$, let $C_t$ be the set of problems decidable on input $x$ in time at most $t(x)$ almost everywhere. The Union Theorem of Meyer and McCreight asserts that any union $\bigcup_{i < \omega} C_{t_i}$ for a uniformly recursive sequence of bounds $t_i$ is ... more >>>

ISSN 1433-8092 | Imprint