Table of contents for issues of Computability

Last update: Sat Oct 14 12:45:44 MDT 2017                Valid HTML 3.2!

Volume 1, Number 1, 2012
Volume 1, Number 2, 2012
Volume 2, Number 1, 2013
Volume 2, Number 2, 2013
Volume 3, Number 1, 2014
Volume 3, Number 2, 2014
Volume 4, Number 1, 2015
Volume 4, Number 2, 2015
Volume 5, Number 1, 2016
Volume 5, Number 2, 2016
Volume 6, Number 2, 2017


Computability
Volume 1, Number 1, 2012

              Vasco Brattka and   
            Paola Bonizzoni and   
            S. Barry Cooper and   
         Benedikt Löwe and   
               Elvira Mayordomo   Editorial  . . . . . . . . . . . . . . . 1--2
             Mathieu Hoyrup and   
     Cristóbal Rojas and   
                Klaus Weihrauch   Computability of the Radon--Nikodym
                                  Derivative . . . . . . . . . . . . . . . 3--13
              Samuel Coskey and   
         Joel David Hamkins and   
                 Russell Miller   The Hierarchy of Equivalence Relations
                                  on the Natural Numbers Under Computable
                                  Reducibility . . . . . . . . . . . . . . 15--38
              John M. Hitchcock   Limitations of Efficient Reducibility to
                                  the Kolmogorov Random Strings  . . . . . 39--43
           Philipp Schlicht and   
             Benjamin Seyfferth   Tree Representations via Ordinal
                                  Machines . . . . . . . . . . . . . . . . 45--57
         Alastair A. Abbott and   
             Cristian S. Calude   Von Neumann Normalisation of a Quantum
                                  Random Number Generator  . . . . . . . . 59--83
       Denis R. Hirschfeldt and   
                  Rebecca Weber   Finite Self-Information  . . . . . . . . 85--98

Computability
Volume 1, Number 2, 2012

            Peter A. Cholak and   
         Damir D. Dzhafarov and   
              Noah Schweber and   
               Richard A. Shore   Computably Enumerable Partial Orders . . 99--107
               Anthony Morphett   Incompleteness, Approximation and
                                  Relative Randomness  . . . . . . . . . . 109--130
                Takayuki Kihara   Incomputability of Simply Connected
                                  Planar Continua  . . . . . . . . . . . . 131--152
            Wolfgang Merkle and   
                  Jason Teutsch   Constant Compression and Random Weights  153--169
           Alexander P. Kreuzer   On the Strength of Weak Compactness  . . 171--179
                      Anonymous   Author Index Volume 1 (2012) . . . . . . 181--181


Computability
Volume 2, Number 1, 2013

         David Diamondstone and   
             Noam Greenberg and   
                Daniel Turetsky   Natural Large Degree Spectra . . . . . . 1--8
                  Hannes Diener   Weak König's Lemma Implies the Uniform
                                  Continuity Theorem . . . . . . . . . . . 9--13
                  Kenshi Miyabe   $ L^1 $-Computability, Layerwise
                                  Computability and Solovay Reducibility   15--29
              Hartmut Ehrig and   
              Claudia Ermel and   
          Falk Hüffner and   
           Rolf Niedermeier and   
                     Olga Runge   Confluence in Data Reduction: Bridging
                                  Graph Transformation and Kernelization   31--49
             Russell Miller and   
                 Hans Schoutens   Computably Categorical Fields via
                                  Fermat's Last Theorem  . . . . . . . . . 51--65
                Dimiter Skordev   On Some Computability Notions for Real
                                  Functions  . . . . . . . . . . . . . . . 67--73

Computability
Volume 2, Number 2, 2013

  François G. Dorais and   
               Jeffry Hirst and   
                    Paul Shafer   Reverse Mathematics and Algebraic Field
                                  Extensions . . . . . . . . . . . . . . . 75--92
               Jacob Carson and   
              Jesse Johnson and   
               Julia Knight and   
                Karen Lange and   
              Charles McCoy and   
                  John Wallbaum   The Arithmetical Hierarchy in the
                                  Setting of $ \omega_1 $  . . . . . . . . 93--105
            Shinnosuke Seki and   
                  Yasushi Okuno   On the Behavior of Tile Assembly System
                                  at High Temperatures . . . . . . . . . . 107--124
     Fernando Soler-Toscano and   
               Hector Zenil and   
         Jean-Paul Delahaye and   
                Nicolas Gauvrit   Correspondence and Independence of
                                  Numerical Evaluations of Algorithmic
                                  Information Measures . . . . . . . . . . 125--140
                      Anonymous   Author Index Volume 2 (2013) . . . . . . 141--142


Computability
Volume 3, Number 1, 2014

               Keng Meng Ng and   
          André Nies and   
                  Frank Stephan   The Complexity of Recursive Splittings
                                  of Random Sets . . . . . . . . . . . . . 1--8
               J. V. Tucker and   
                   J. I. Zucker   Computability of Operators on Continuous
                                  and Discrete Time Streams  . . . . . . . 9--44
              Cameron Freer and   
 Bjò rn Kjos-Hanssen and   
          André Nies and   
                  Frank Stephan   Algorithmic Aspects of Lipschitz
                                  Functions  . . . . . . . . . . . . . . . 45--61
                 Stela Nikolova   Shared thoughts on Ivan--Soskov
                                  (1954--2013) . . . . . . . . . . . . . . 63--72

Computability
Volume 3, Number 2, 2014

     Johanna N. Y. Franklin and   
                   Reed Solomon   Degrees that Are Low for Isomorphism . . 73--89
            Ryan C. Harkins and   
          John M. Hitchcock and   
                       A. Pavan   Strong Reductions and Isomorphism of
                                  Complete Sets  . . . . . . . . . . . . . 91--104
             Wesley Calvert and   
        Valentina Harizanov and   
          Alexandra Shlapentokh   Turing Degrees of Isomorphism Types of
                                  Geometric Objects  . . . . . . . . . . . 105--134
            Cristina Bazgan and   
              Morgan Chopin and   
   André Nichterlein and   
                 Florian Sikora   Parameterized Inapproximability of
                                  Target Set Selection and Generalizations 135--145
                      Anonymous   Author Index Volume 3 (2014) . . . . . . 147--147


Computability
Volume 4, Number 1, 2015

     Matthias Schröder and   
               Victor Selivanov   Hyperprojective hierarchy of
                                  qcb$_0$-spaces . . . . . . . . . . . . . 1--17
              Amir M. Ben-Amram   Mortality of iterated piecewise affine
                                  functions over the integers:
                                  Decidability and complexity  . . . . . . 19--56
                  Henry Towsner   On maximum conservative extensions . . . 57--68
                  Ludovic Patey   The complexity of satisfaction problems
                                  in reverse mathematics . . . . . . . . . 69--84

Computability
Volume 4, Number 2, 2015

               Jack H. Lutz and   
                      Neil Lutz   Lines missing every random point . . . . 85--102
                Kirill Gura and   
            Jeffry L. Hirst and   
                   Carl Mummert   On the existence of a connected
                                  component of a graph . . . . . . . . . . 103--117
              Charles M. Harris   On limitwise monotonicity and maximal
                                  block functions  . . . . . . . . . . . . 119--139
                  Eric P. Astor   Asymptotic density, immunity and
                                  randomness . . . . . . . . . . . . . . . 141--158
         Stanislav O. Speranski   Some new results in monadic second-order
                                  arithmetic . . . . . . . . . . . . . . . 159--174


Computability
Volume 5, Number 1, 2016

              Vasco Brattka and   
            Paola Bonizzoni and   
            Olivier Bournez and   
               Elvira Mayordomo   Editorial  . . . . . . . . . . . . . . . 1--1
             Benedikt Löwe   Barry Cooper (1943--2015): The engine of
                                  \em Computability in Europe  . . . . . . 3--11
       Denis R. Hirschfeldt and   
       Carl G. Jockusch Jr. and   
       Timothy H. McNicholl and   
                 Paul E. Schupp   Asymptotic density and the coarse
                                  computability bound  . . . . . . . . . . 13--27
             Sankha S. Basu and   
             Stephen G. Simpson   Mass problems and intuitionistic
                                  higher-order logic . . . . . . . . . . . 29--47
              Albert A. Muchnik   Strong and weak reducibility of
                                  algorithmic problems1  . . . . . . . . . 49--59
                    Dag Normann   On the Cantor--Bendixson rank of a set
                                  that is searchable in Gödel's $T$ . . . . 61--74
          Matthew de Brecht and   
     Matthias Schröder and   
               Victor Selivanov   Base-complexity classifications of
                                  qcb$_0$-spaces1  . . . . . . . . . . . . 75--102

Computability
Volume 5, Number 2, 2016

                    Ian Herbert   Lowness for integer-valued randomness    103--109
              Mingzhong Cai and   
              Steffen Lempp and   
           Joseph S. Miller and   
              Mariya I. Soskova   On Kalimullin pairs  . . . . . . . . . . 111--126
                 Eric Faber and   
                Jaap van Oosten   Effective operations of type 2 in PCAs   127--146
          Rupert Hölzl and   
              Frank Stephan and   
                       Liang Yu   On Martin's pointed tree theorem . . . . 147--157
                     Arno Pauly   On the topological aspects of the theory
                                  of represented spaces  . . . . . . . . . 159--180
                    Merlin Carl   Randomness and degree theory for
                                  infinite time register machines  . . . . 181--196
                      Anonymous   Author Index Volume 5 (2016) . . . . . . 197--197


Computability
Volume 6, Number 2, 2017

         Damir D. Dzhafarov and   
                  Gregory Igusa   Notions of robust information coding . . 105--124
         Martin Huschenbett and   
          Alexander Kartzow and   
               Philipp Schlicht   Pumping for ordinal-automatic structures
                                  $^1$ . . . . . . . . . . . . . . . . . . 125--164
            Oscar H. Ibarra and   
                  Cewei Cui and   
                   Zhe Dang and   
              Thomas R. Fischer   Lossiness of communication channels
                                  modeled by transducers . . . . . . . . . 165--181
                 Rica Gonen and   
                    Anat Lerner   Characterizing incentive compatible,
                                  Pareto optimal and sufficiently
                                  anonymous constrained combinatorial
                                  mechanisms --- Two players case  . . . . 183--208
                      Anonymous   Author Index Volume 6 (2017) . . . . . . 209--209