nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A differential extension of Descartes’ foundational approach: A new balance between symbolic and analog computation
|
Milici, Pietro |
|
|
|
1 |
p. 51-83 |
artikel |
2 |
Algorithmic Aspects of Lipschitz Functions
|
Freer, Cameron |
|
2014 |
|
1 |
p. 45-61 |
artikel |
3 |
An ω-REA set forming a minimal pair with 0~′
|
Gerdes, Peter |
|
|
|
1 |
p. 37-50 |
artikel |
4 |
Asymptotic density and the coarse computability bound
|
Hirschfeldt, Denis R. |
|
2016 |
|
1 |
p. 13-27 |
artikel |
5 |
Barry Cooper (1943–2015): The engine of Computability in Europe
|
Löwe, Benedikt |
|
2016 |
|
1 |
p. 3-11 |
artikel |
6 |
Base-complexity classifications of qcb0-spaces1
|
de Brecht, Matthew |
|
2016 |
|
1 |
p. 75-102 |
artikel |
7 |
Characterizing time computational complexity classes with polynomial differential equations
|
Gozzi, Riccardo |
|
|
|
1 |
p. 23-57 |
artikel |
8 |
Closed left-r.e. sets
|
Jain, Sanjay |
|
2016 |
|
1 |
p. 1-21 |
artikel |
9 |
Computability of Operators on Continuous and Discrete Time Streams
|
Tucker, J.V |
|
2014 |
|
1 |
p. 9-44 |
artikel |
10 |
Computability of the Radon-Nikodym Derivative
|
Hoyrup, Mathieu |
|
2012 |
|
1 |
p. 3-13 |
artikel |
11 |
Computability on measurable functions
|
Weihrauch, Klaus |
|
2016 |
|
1 |
p. 79-104 |
artikel |
12 |
Computable intersection points
|
Iljazović, Zvonko |
|
2018 |
|
1 |
p. 57-99 |
artikel |
13 |
Computably Categorical Fields via Fermat’s Last Theorem
|
Miller, Russell |
|
2013 |
|
1 |
p. 51-65 |
artikel |
14 |
Computably enumerable sets that are automorphic to low sets
|
Cholak, Peter |
|
2016 |
|
1 |
p. 23-45 |
artikel |
15 |
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
|
Ehrig, Hartmut |
|
2013 |
|
1 |
p. 31-49 |
artikel |
16 |
Controlling iterated jumps of solutions to combinatorial problems
|
Patey, Ludovic |
|
2016 |
|
1 |
p. 47-78 |
artikel |
17 |
Countable sets versus sets that are countable in reverse mathematics
|
Sanders, Sam |
|
|
|
1 |
p. 9-39 |
artikel |
18 |
Definitional schemes for primitive recursive and computable functions
|
Nielsen, Pace P. |
|
|
|
1 |
p. 1-8 |
artikel |
19 |
Degrees of bi-embeddable categoricity
|
Bazhenov, Nikolay |
|
|
|
1 |
p. 1-16 |
artikel |
20 |
Diminishable parameterized problems and strict polynomial kernelization
|
Fernau, Henning |
|
|
|
1 |
p. 1-24 |
artikel |
21 |
Editorial
|
Brattka, Vasco |
|
2012 |
|
1 |
p. 1-2 |
artikel |
22 |
Editorial
|
Brattka, Vasco |
|
2016 |
|
1 |
p. 1 |
artikel |
23 |
Enumerations of families closed under finite differences
|
Greenberg, Noam |
|
|
|
1 |
p. 89-104 |
artikel |
24 |
Evitable iterates of the consistency operator
|
Walsh, James |
|
|
|
1 |
p. 59-69 |
artikel |
25 |
Feasible set functions have small circuits
|
Beckmann, Arnold |
|
2018 |
|
1 |
p. 67-98 |
artikel |
26 |
Finite Self-Information
|
Hirschfeldt, Denis R. |
|
2012 |
|
1 |
p. 85-98 |
artikel |
27 |
Hyperprojective hierarchy of qcb0-spaces
|
Schröder, Matthias |
|
2015 |
|
1 |
p. 1-17 |
artikel |
28 |
Insertion-deletion systems with substitutions I
|
Vu, Martin |
|
|
|
1 |
p. 57-83 |
artikel |
29 |
L1-Computability, Layerwise Computability and Solovay Reducibility
|
Miyabe, Kenshi |
|
2013 |
|
1 |
p. 15-29 |
artikel |
30 |
Limitations of Efficient Reducibility to the Kolmogorov Random Strings
|
Hitchcock, John M. |
|
2012 |
|
1 |
p. 39-43 |
artikel |
31 |
Lowness for isomorphism and degrees of genericity
|
Franklin, Johanna N.Y. |
|
2018 |
|
1 |
p. 1-6 |
artikel |
32 |
Lowness properties for strong reducibilities and the computational power of maximal sets
|
Ambos-Spies, Klaus |
|
|
|
1 |
p. 1-56 |
artikel |
33 |
Mass problems and intuitionistic higher-order logic
|
Basu, Sankha S. |
|
2016 |
|
1 |
p. 29-47 |
artikel |
34 |
Mortality of iterated piecewise affine functions over the integers: Decidability and complexity
|
Ben-Amram, Amir M. |
|
2015 |
|
1 |
p. 19-56 |
artikel |
35 |
Natural Large Degree Spectra
|
Diamondstone, David |
|
2013 |
|
1 |
p. 1-8 |
artikel |
36 |
Nearly computable real numbers
|
Hertling, Peter |
|
|
|
1 |
p. 57-88 |
artikel |
37 |
Nets and reverse mathematics
|
Sanders, Sam |
|
|
|
1 |
p. 31-62 |
artikel |
38 |
Notions of semicomputability in topological algebras over the reals
|
Armstrong, Mark |
|
2018 |
|
1 |
p. 1-26 |
artikel |
39 |
On characterizations of randomized computation using plain Kolmogorov complexity1
|
Hirahara, Shuichi |
|
2018 |
|
1 |
p. 45-56 |
artikel |
40 |
On maximum conservative extensions
|
Towsner, Henry |
|
2015 |
|
1 |
p. 57-68 |
artikel |
41 |
On Some Computability Notions for Real Functions
|
Skordev, Dimiter |
|
2013 |
|
1 |
p. 67-73 |
artikel |
42 |
On subrecursive representability of irrational numbers, part II
|
Kristiansen, Lars |
|
2018 |
|
1 |
p. 43-65 |
artikel |
43 |
On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T
|
Normann, Dag |
|
2016 |
|
1 |
p. 61-74 |
artikel |
44 |
Primitive recursive ordered fields and some applications
|
Selivanov, Victor |
|
|
|
1 |
p. 71-99 |
artikel |
45 |
Randomness extraction in computability theory
|
Cenzer, Douglas |
|
|
|
1 |
p. 1-21 |
artikel |
46 |
Representations and evaluation strategies for feasibly approximable functions
|
Konečný, Michal |
|
|
|
1 |
p. 63-89 |
artikel |
47 |
Shared thoughts on Ivan Soskov (1954–2013)
|
Nikolova, Stela |
|
2014 |
|
1 |
p. 63-72 |
artikel |
48 |
Space-bounded OTMs and REG∞
|
Carl, Merlin |
|
|
|
1 |
p. 41-56 |
artikel |
49 |
Strong and weak reducibility of algorithmic problems1
|
Muchnik, Albert A. |
|
2016 |
|
1 |
p. 49-59 |
artikel |
50 |
Surjective H-colouring: New hardness results
|
Golovach, Petr A. |
|
2018 |
|
1 |
p. 27-42 |
artikel |
51 |
The Complexity of Recursive Splittings of Random Sets
|
Ng, Keng Meng |
|
2014 |
|
1 |
p. 1-8 |
artikel |
52 |
The complexity of satisfaction problems in reverse mathematics
|
Patey, Ludovic |
|
2015 |
|
1 |
p. 69-84 |
artikel |
53 |
The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis
|
Sanders, Sam |
|
2018 |
|
1 |
p. 7-43 |
artikel |
54 |
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
|
Coskey, Samuel |
|
2012 |
|
1 |
p. 15-38 |
artikel |
55 |
The strength of compactness for countable complete linear orders
|
Shafer, Paul |
|
|
|
1 |
p. 25-36 |
artikel |
56 |
Tree Representations via Ordinal Machines
|
Schlicht, Philipp |
|
2012 |
|
1 |
p. 45-57 |
artikel |
57 |
Von Neumann Normalisation of a Quantum Random Number Generator
|
Abbott, Alastair A. |
|
2012 |
|
1 |
p. 59-83 |
artikel |
58 |
Weak König’s Lemma Implies the Uniform Continuity Theorem
|
Diener, Hannes |
|
2013 |
|
1 |
p. 9-13 |
artikel |
59 |
Weihrauch and constructive reducibility between existence statements
|
Fujiwara, Makoto |
|
|
|
1 |
p. 17-30 |
artikel |