| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
|
Graça, Daniel
|
|
|
|
2 |
p. 117-144
|
article
|
| 2 |
A note on the diamond operator
|
Westrick, Linda
|
|
|
|
2 |
p. 107-110
|
article
|
| 3 |
A statistical anytime algorithm for the Halting Problem
|
Calude, Cristian S.
|
|
|
|
2 |
p. 155-166
|
article
|
| 4 |
Asymptotic density, immunity and randomness
|
Astor, Eric P.
|
|
2015
|
|
2 |
p. 141-158
|
article
|
| 5 |
Author Index Volume 3 (2014)
|
|
|
2014
|
|
2 |
p. 147
|
article
|
| 6 |
Author Index Volume 2 (2013)
|
|
|
2013
|
|
2 |
p. 141-142
|
article
|
| 7 |
Author Index Volume 1 (2012)
|
|
|
2013
|
|
2 |
p. 181
|
article
|
| 8 |
Author Index Volume 6 (2017)
|
|
|
2017
|
|
2 |
p. 209
|
article
|
| 9 |
Author Index Volume 5 (2016)
|
|
|
2016
|
|
2 |
p. 197
|
article
|
| 10 |
Bar recursion is not computable via iteration
|
Longley, John
|
|
2019
|
|
2 |
p. 119-153
|
article
|
| 11 |
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
|
Selivanova, Svetlana
|
|
|
|
2 |
p. 123-140
|
article
|
| 12 |
Cantor–Bendixson ranks of effectively closed sets in admissible recursion theory
|
Johnston, Reese
|
|
|
|
2 |
p. 111-125
|
article
|
| 13 |
Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
|
Welch, Philip
|
|
|
|
2 |
p. 159-180
|
article
|
| 14 |
Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case
|
Gonen, Rica
|
|
2017
|
|
2 |
p. 183-208
|
article
|
| 15 |
COH, SRT22, and multiple functionals
|
Dzhafarov, Damir D.
|
|
|
|
2 |
p. 111-121
|
article
|
| 16 |
Computably Enumerable Partial Orders
|
Cholak, Peter A.
|
|
2013
|
|
2 |
p. 99-107
|
article
|
| 17 |
Constant Compression and Random Weights
|
Merkle, Wolfgang
|
|
2013
|
|
2 |
p. 153-169
|
article
|
| 18 |
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
|
Soler-Toscano, Fernando
|
|
2013
|
|
2 |
p. 125-140
|
article
|
| 19 |
Degrees of categoricity above limit ordinals
|
Csima, Barbara F.
|
|
|
|
2 |
p. 127-137
|
article
|
| 20 |
Degrees that Are Low for Isomorphism
|
Franklin, Johanna N.Y.
|
|
2014
|
|
2 |
p. 73-89
|
article
|
| 21 |
Dense computability, upper cones, and minimal pairs
|
Astor, Eric P.
|
|
2019
|
|
2 |
p. 155-177
|
article
|
| 22 |
Dimension spectra of lines1
|
Lutz, Neil
|
|
|
|
2 |
p. 85-112
|
article
|
| 23 |
Effective operations of type 2 in PCAs
|
Faber, Eric
|
|
2016
|
|
2 |
p. 127-146
|
article
|
| 24 |
Fixpoints and relative precompleteness
|
Golov, Anton
|
|
|
|
2 |
p. 135-146
|
article
|
| 25 |
Incompleteness, Approximation and Relative Randomness
|
Morphett, Anthony
|
|
2013
|
|
2 |
p. 109-130
|
article
|
| 26 |
Incomputability of Simply Connected Planar Continua
|
Kihara, Takayuki
|
|
2013
|
|
2 |
p. 131-152
|
article
|
| 27 |
Intersection points of planar curves can be computed
|
Weihrauch, Klaus
|
|
|
|
2 |
p. 113-133
|
article
|
| 28 |
Isomorphism and classification for countable structures
|
Miller, Russell
|
|
2019
|
|
2 |
p. 99-117
|
article
|
| 29 |
L2-Betti numbers and computability of reals
|
Löh, Clara
|
|
|
|
2 |
p. 175-201
|
article
|
| 30 |
Limit computability and ultrafilters
|
Andrews, Uri
|
|
|
|
2 |
p. 101-115
|
article
|
| 31 |
Lines missing every random point1
|
Lutz, Jack H.
|
|
2015
|
|
2 |
p. 85-102
|
article
|
| 32 |
Lossiness of communication channels modeled by transducers1
|
Ibarra, Oscar H.
|
|
2017
|
|
2 |
p. 165-181
|
article
|
| 33 |
Lowness for integer-valued randomness
|
Herbert, Ian
|
|
2016
|
|
2 |
p. 103-109
|
article
|
| 34 |
Measure-theoretic uniformity and the Suslin functional
|
Normann, Dag
|
|
|
|
2 |
p. 91-105
|
article
|
| 35 |
New bounds on the strength of some restrictions of Hindman’s Theorem
|
Carlucci, Lorenzo
|
|
|
|
2 |
p. 139-153
|
article
|
| 36 |
Notions of robust information coding
|
Dzhafarov, Damir D.
|
|
2017
|
|
2 |
p. 105-124
|
article
|
| 37 |
On Kalimullin pairs
|
Cai, Mingzhong
|
|
2016
|
|
2 |
p. 111-126
|
article
|
| 38 |
On limitwise monotonicity and maximal block functions
|
Harris, Charles M.
|
|
2015
|
|
2 |
p. 119-139
|
article
|
| 39 |
On Martin’s pointed tree theorem
|
Hölzl, Rupert
|
|
2016
|
|
2 |
p. 147-157
|
article
|
| 40 |
On the Behavior of Tile Assembly System at High Temperatures
|
Seki, Shinnosuke
|
|
2013
|
|
2 |
p. 107-124
|
article
|
| 41 |
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
|
Allender, Eric
|
|
|
|
2 |
p. 145-173
|
article
|
| 42 |
On the existence of a connected component of a graph
|
Gura, Kirill
|
|
2015
|
|
2 |
p. 103-117
|
article
|
| 43 |
On the Strength of Weak Compactness
|
Kreuzer, Alexander P.
|
|
2013
|
|
2 |
p. 171-179
|
article
|
| 44 |
On the topological aspects of the theory of represented spaces
|
Pauly, Arno
|
|
2016
|
|
2 |
p. 159-180
|
article
|
| 45 |
Parameterized Inapproximability of Target Set Selection and Generalizations
|
Bazgan, Cristina
|
|
2014
|
|
2 |
p. 135-145
|
article
|
| 46 |
Pumping for ordinal-automatic structures1
|
Huschenbett, Martin
|
|
2017
|
|
2 |
p. 125-164
|
article
|
| 47 |
Ramsey’s theorem and products in the Weihrauch degrees
|
Dzhafarov, Damir D.
|
|
|
|
2 |
p. 85-110
|
article
|
| 48 |
Randomness and degree theory for infinite time register machines1
|
Carl, Merlin
|
|
2016
|
|
2 |
p. 181-196
|
article
|
| 49 |
Reverse Mathematics and Algebraic Field Extensions
|
Dorais, François G.
|
|
2013
|
|
2 |
p. 75-92
|
article
|
| 50 |
Some new results in monadic second-order arithmetic
|
Speranski, Stanislav O.
|
|
2015
|
|
2 |
p. 159-174
|
article
|
| 51 |
Strong Reductions and Isomorphism of Complete Sets
|
Harkins, Ryan C.
|
|
2014
|
|
2 |
p. 91-104
|
article
|
| 52 |
The Arithmetical Hierarchy in the Setting of $\omega_1$
|
Carson, Jacob
|
|
2013
|
|
2 |
p. 93-105
|
article
|
| 53 |
The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
|
Daylight, Edgar G.
|
|
|
|
2 |
p. 141-158
|
article
|
| 54 |
The isometry degree of a computable copy of ℓp1
|
McNicholl, Timothy H.
|
|
2019
|
|
2 |
p. 179-189
|
article
|
| 55 |
The Jacobson radical for an inconsistency predicate
|
Schuster, Peter
|
|
|
|
2 |
p. 147-162
|
article
|
| 56 |
Turing Degrees of Isomorphism Types of Geometric Objects
|
Calvert, Wesley
|
|
2014
|
|
2 |
p. 105-134
|
article
|
Journal description