Computability and Complexity

The Complexity of Complexity

Allender, Eric

Pages 79-94

Bounded Pushdown Dimension vs Lempel Ziv Information Density

Albert, Pilar (et al.)

Pages 95-114

Complexity with Rod

Fortnow, Lance

Pages 115-121

On Being Rod’s Graduate Student

Ng, Keng Meng

Pages 122-123

Herrmann’s Beautiful Theorem on Computable Partial Orderings

Jockusch, Carl G., Jr.

Pages 127-133

Effectiveness of Hindman’s Theorem for Bounded Sums

Dzhafarov, Damir D. (et al.)

Pages 134-142

Reverse Mathematics of Matroids

Hirst, Jeffry L. (et al.)

Pages 143-159

Weakly Represented Families in Reverse Mathematics

Hölzl, Rupert (et al.)

Pages 160-187

The Vitali Covering Theorem in the Weihrauch Lattice

Brattka, Vasco (et al.)

Pages 188-200

Parallel and Serial Jumps of Weak Weak König’s Lemma

Bienvenu, Laurent (et al.)

Pages 201-217

Effectively Existentially-Atomic Structures

Montalbán, Antonio

Pages 221-237

Irreducibles and Primes in Computable Integral Domains

Evron, Leigh (et al.)

Pages 238-253

Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey

Miller, Russell

Pages 254-270

Enumeration Reducibility and Computable Structure Theory

Soskova, Alexandra A. (et al.)

Pages 271-301

Strength and Weakness in Computable Structure Theory

Franklin, Johanna N. Y.

Pages 302-323

On Constructive Nilpotent Groups

Khisamiev, Nazif G. (et al.)

Pages 324-353

Computable Model Theory over the Reals

Morozov, Andrey S.

Pages 354-365

The Lattice of Computably Enumerable Vector Spaces

Dimitrov, Rumen D. (et al.)

Pages 366-393

Injection Structures Specified by Finite State Transducers

Buss, Sam (et al.)

Pages 394-417

A Survey on Universal Computably Enumerable Equivalence Relations

Andrews, Uri (et al.)

Pages 418-451

$$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$

Harrington, Leo (et al.)

Pages 455-466

A Survey of Results on the d-c.e. and n-c.e. Degrees

Arslanov, Marat M. (et al.)

Pages 469-478

There Are No Maximal d.c.e. wtt-degrees

Wu, Guohua (et al.)

Pages 479-486

A Rigid Cone in the Truth-Table Degrees with Jump

Kjos-Hanssen, Bjørn

Pages 487-500

Asymptotic Density and the Theory of Computability: A Partial Survey

Jockusch, Carl G., Jr. (et al.)

Pages 501-520

On Splits of Computably Enumerable Sets

Cholak, Peter A.

Pages 521-535

1-Generic Degrees Bounding Minimal Degrees Revisited

Chong, C. T.

Pages 536-546

Nondensity of Double Bubbles in the D.C.E. Degrees

Andrews, Uri (et al.)

Pages 547-562

On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets

Ambos-Spies, Klaus

Pages 563-598

Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees

Kjos-Hanssen, Bjørn

Pages 599-607

On the Reals Which Cannot Be Random

Yu, Liang (et al.)

Pages 611-622

A Note on the Differences of Computably Enumerable Reals

Barmpalias, George (et al.)

Pages 623-632

Effective Bi-immunity and Randomness

Beros, Achilles A. (et al.)

Pages 633-643

On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals

Miller, Joseph S.

Pages 644-659

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions

Simpson, Stephen G.

Pages 660-668

Algorithmic Statistics: Forty Years Later

Vereshchagin, Nikolay (et al.)

Pages 669-737

Lowness, Randomness, and Computable Analysis

Nies, André

Pages 738-754

Erratum to: There Are No Maximal d.c.e. wtt-degrees

Wu, Guohua (et al.)

Pages E1-E1