Journal: Computability

Volume 6, Issue 4

307 -- 318Alexei Miasnikov, Paul Schupp. Computational complexity and the conjugacy problem
319 -- 331Emanuele Frittaion, Ludovic Patey. Coloring the rationals in reverse mathematics
333 -- 363Arthur Milchior. Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set
365 -- 389Francis Adams, Douglas Cenzer. Computability and categoricity of weakly ultrahomogeneous structures
391 -- 408Timothy H. McNicholl. Computable copies of ℓp

Volume 6, Issue 3

209 -- 221Ludovic Patey. Iterative forcing and hyperimmunity in reverse mathematics
223 -- 247Merlin Carl. Infinite time recognizability from generic oracles and the recognizable jump operator
249 -- 276Lars Kristiansen. On subrecursive representability of irrational numbers
277 -- 305Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar. Dimension, pseudorandomness and extraction of pseudorandomness

Volume 6, Issue 2

105 -- 124Damir D. Dzhafarov, Gregory Igusa. Notions of robust information coding
125 -- 164Martin Huschenbett, Alexander Kartzow, Philipp Schlicht. 1
165 -- 181Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer. 1
183 -- 208Rica Gonen, Anat Lerner. Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms - Two players case

Volume 6, Issue 1

1 -- 21Sanjay Jain, Frank Stephan, Jason Teutsch. Closed left-r.e. sets
23 -- 45Peter Cholak, Rachel Epstein. Computably enumerable sets that are automorphic to low sets
47 -- 78Ludovic Patey. Controlling iterated jumps of solutions to combinatorial problems
79 -- 104Klaus Weihrauch. Computability on measurable functions