Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             56 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('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
artikel
2 A note on the diamond operator Westrick, Linda

2 p. 107-110
artikel
3 A statistical anytime algorithm for the Halting Problem Calude, Cristian S.

2 p. 155-166
artikel
4 Asymptotic density, immunity and randomness Astor, Eric P.
2015
2 p. 141-158
artikel
5 Author Index Volume 3 (2014) 2014
2 p. 147
artikel
6 Author Index Volume 2 (2013) 2013
2 p. 141-142
artikel
7 Author Index Volume 1 (2012) 2013
2 p. 181
artikel
8 Author Index Volume 6 (2017) 2017
2 p. 209
artikel
9 Author Index Volume 5 (2016) 2016
2 p. 197
artikel
10 Bar recursion is not computable via iteration Longley, John
2019
2 p. 119-153
artikel
11 Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision Selivanova, Svetlana

2 p. 123-140
artikel
12 Cantor–Bendixson ranks of effectively closed sets in admissible recursion theory Johnston, Reese

2 p. 111-125
artikel
13 Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines Welch, Philip

2 p. 159-180
artikel
14 Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case Gonen, Rica
2017
2 p. 183-208
artikel
15 COH, SRT22, and multiple functionals Dzhafarov, Damir D.

2 p. 111-121
artikel
16 Computably Enumerable Partial Orders Cholak, Peter A.
2013
2 p. 99-107
artikel
17 Constant Compression and Random Weights Merkle, Wolfgang
2013
2 p. 153-169
artikel
18 Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures Soler-Toscano, Fernando
2013
2 p. 125-140
artikel
19 Degrees of categoricity above limit ordinals Csima, Barbara F.

2 p. 127-137
artikel
20 Degrees that Are Low for Isomorphism Franklin, Johanna N.Y.
2014
2 p. 73-89
artikel
21 Dense computability, upper cones, and minimal pairs Astor, Eric P.
2019
2 p. 155-177
artikel
22 Dimension spectra of lines1 Lutz, Neil

2 p. 85-112
artikel
23 Effective operations of type 2 in PCAs Faber, Eric
2016
2 p. 127-146
artikel
24 Fixpoints and relative precompleteness Golov, Anton

2 p. 135-146
artikel
25 Incompleteness, Approximation and Relative Randomness Morphett, Anthony
2013
2 p. 109-130
artikel
26 Incomputability of Simply Connected Planar Continua Kihara, Takayuki
2013
2 p. 131-152
artikel
27 Intersection points of planar curves can be computed Weihrauch, Klaus

2 p. 113-133
artikel
28 Isomorphism and classification for countable structures Miller, Russell
2019
2 p. 99-117
artikel
29 L2-Betti numbers and computability of reals Löh, Clara

2 p. 175-201
artikel
30 Limit computability and ultrafilters Andrews, Uri

2 p. 101-115
artikel
31 Lines missing every random point1 Lutz, Jack H.
2015
2 p. 85-102
artikel
32 Lossiness of communication channels modeled by transducers1 Ibarra, Oscar H.
2017
2 p. 165-181
artikel
33 Lowness for integer-valued randomness Herbert, Ian
2016
2 p. 103-109
artikel
34 Measure-theoretic uniformity and the Suslin functional Normann, Dag

2 p. 91-105
artikel
35 New bounds on the strength of some restrictions of Hindman’s Theorem Carlucci, Lorenzo

2 p. 139-153
artikel
36 Notions of robust information coding Dzhafarov, Damir D.
2017
2 p. 105-124
artikel
37 On Kalimullin pairs Cai, Mingzhong
2016
2 p. 111-126
artikel
38 On limitwise monotonicity and maximal block functions Harris, Charles M.
2015
2 p. 119-139
artikel
39 On Martin’s pointed tree theorem Hölzl, Rupert
2016
2 p. 147-157
artikel
40 On the Behavior of Tile Assembly System at High Temperatures Seki, Shinnosuke
2013
2 p. 107-124
artikel
41 On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 Allender, Eric

2 p. 145-173
artikel
42 On the existence of a connected component of a graph Gura, Kirill
2015
2 p. 103-117
artikel
43 On the Strength of Weak Compactness Kreuzer, Alexander P.
2013
2 p. 171-179
artikel
44 On the topological aspects of the theory of represented spaces Pauly, Arno
2016
2 p. 159-180
artikel
45 Parameterized Inapproximability of Target Set Selection and Generalizations Bazgan, Cristina
2014
2 p. 135-145
artikel
46 Pumping for ordinal-automatic structures1 Huschenbett, Martin
2017
2 p. 125-164
artikel
47 Ramsey’s theorem and products in the Weihrauch degrees Dzhafarov, Damir D.

2 p. 85-110
artikel
48 Randomness and degree theory for infinite time register machines1 Carl, Merlin
2016
2 p. 181-196
artikel
49 Reverse Mathematics and Algebraic Field Extensions Dorais, François G.
2013
2 p. 75-92
artikel
50 Some new results in monadic second-order arithmetic Speranski, Stanislav O.
2015
2 p. 159-174
artikel
51 Strong Reductions and Isomorphism of Complete Sets Harkins, Ryan C.
2014
2 p. 91-104
artikel
52 The Arithmetical Hierarchy in the Setting of $\omega_1$ Carson, Jacob
2013
2 p. 93-105
artikel
53 The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian Daylight, Edgar G.

2 p. 141-158
artikel
54 The isometry degree of a computable copy of ℓp1 McNicholl, Timothy H.
2019
2 p. 179-189
artikel
55 The Jacobson radical for an inconsistency predicate Schuster, Peter

2 p. 147-162
artikel
56 Turing Degrees of Isomorphism Types of Geometric Objects Calvert, Wesley
2014
2 p. 105-134
artikel
                             56 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland