| Publication | Date of Publication | Type |
|---|
| What perceptron neural networks are (not) good for? | 2024-04-18 | Paper |
| Randomness as an invariant for number representations | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6160875 | 2023-06-02 | Paper |
| Effective category and measure in abstract complexity theory | 2022-12-09 | Paper |
| LIARS, DEMONS, AND CHAOS | 2022-12-06 | Paper |
| Deciding Parity Games in Quasi-polynomial Time | 2022-05-03 | Paper |
| To Halt or Not to Halt? That Is the Question | 2022-04-04 | Paper |
| Incompleteness and the halting problem | 2021-12-27 | Paper |
| Bi-immunity over different size alphabets | 2021-11-11 | Paper |
| Quantum solutions for densest \(k\)-subgraph problems | 2021-09-14 | Paper |
| A new quantum random number generator certified by value indefiniteness | 2021-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964008 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5151012 | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145146 | 2021-01-20 | Paper |
| A statistical anytime algorithm for the Halting Problem | 2020-11-09 | Paper |
| The Road to Quantum Computational Supremacy | 2020-07-21 | Paper |
| Searching for shortest and least programs | 2020-01-22 | Paper |
| A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing | 2020-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967214 | 2019-07-03 | Paper |
| Liouville, computable, Borel normal and Martin-Löf random numbers | 2018-10-05 | Paper |
| A probabilistic anytime algorithm for the halting problem | 2018-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376332 | 2018-09-17 | Paper |
| QUBO formulations for the graph isomorphism problem and related problems | 2017-12-06 | Paper |
| Deciding parity games in quasipolynomial time | 2017-08-17 | Paper |
| Incompleteness, Undecidability and Automated Proofs | 2016-11-09 | Paper |
| A quantum random number generator certified by value indefiniteness | 2016-07-26 | Paper |
| Universality and Almost Decidability | 2016-05-11 | Paper |
| Finite state incompressible infinite sequences | 2016-03-10 | Paper |
| A variant of the Kochen-Specker theorem localising value indefiniteness | 2015-11-06 | Paper |
| Anytime Algorithms for Non-Ending Computations | 2015-09-29 | Paper |
| On the Unpredictability of Individual Quantum Measurement Outcomes | 2015-09-22 | Paper |
| The complexity of proving chaoticity and the Church–Turing thesis | 2015-05-19 | Paper |
| CODING WITH MINIMAL PROGRAMS | 2015-04-30 | Paper |
| Finite State Incompressible Infinite Sequences | 2014-04-16 | Paper |
| INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM | 2014-04-10 | Paper |
| INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS | 2013-10-23 | Paper |
| Spectral Representation of Some Computably Enumerable Sets with an Application to Quantum Provability | 2013-06-28 | Paper |
| An Empirical Approach to the Normality of π | 2013-03-06 | Paper |
| The Universe is Lawless or “Pantôn chrêmatôn metron anthrôpon einai” | 2013-02-26 | Paper |
| Is Feasibility in Physics Limited by Fantasy Alone? | 2013-02-26 | Paper |
| Von Neumann Normalisation of a Quantum Random Number Generator | 2013-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904104 | 2013-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904136 | 2013-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904143 | 2013-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904159 | 2013-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904218 | 2013-01-28 | Paper |
| Inductive Complexity of P versus NP Problem | 2012-11-08 | Paper |
| Introduction: computability of the physical | 2012-10-23 | Paper |
| The complexity of Euler's integer partition theorem | 2012-10-11 | Paper |
| STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY | 2012-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224089 | 2012-03-29 | Paper |
| Finite state complexity | 2011-10-10 | Paper |
| The complexity of the four colour theorem | 2011-09-15 | Paper |
| Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits | 2011-06-17 | Paper |
| Universal recursively enumerable sets of strings | 2011-05-10 | Paper |
| Representation of left-computable \(\varepsilon \)-random reals | 2011-04-28 | Paper |
| AN OBSERVER-BASED DE-QUANTISATION OF DEUTSCH'S ALGORITHM | 2011-02-23 | Paper |
| Simplicity via provability for universal prefix-free Turing machines | 2011-01-10 | Paper |
| A note on accelerated Turing machines | 2010-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3584055 | 2010-08-18 | Paper |
| Algorithmically independent sequences | 2010-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5188206 | 2010-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5188221 | 2010-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3182722 | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396014 | 2009-09-15 | Paper |
| Every computably enumerable random real is provably computably enumerable random | 2009-08-12 | Paper |
| A topological characterization of random sequences | 2009-07-09 | Paper |
| Formal Proof: Reconciling Correctness and Understanding | 2009-07-09 | Paper |
| Topology on words | 2009-06-04 | Paper |
| Aspects of Molecular Computing | 2009-05-14 | Paper |
| Information: The Algorithmic Paradigm | 2009-05-12 | Paper |
| On universal computably enumerable prefix codes | 2009-03-24 | Paper |
| Universal Recursively Enumerable Sets of Strings | 2008-10-30 | Paper |
| Algorithmically Independent Sequences | 2008-10-30 | Paper |
| EXACT APPROXIMATIONS OF OMEGA NUMBERS | 2008-07-02 | Paper |
| Most programs stop quickly or never halt | 2008-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5448310 | 2008-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5439769 | 2008-02-11 | Paper |
| From Heisenberg to Gödel via Chaitin | 2007-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422230 | 2007-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310873 | 2007-10-15 | Paper |
| Computational complementarity and shift spaces | 2007-08-06 | Paper |
| DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM | 2007-06-20 | Paper |
| Natural halting probabilities, partial randomness, and zeta functions | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409973 | 2006-11-21 | Paper |
| From Heisenberg to Gödel via Chaitin | 2006-09-28 | Paper |
| Computing a Glimpse of Randomness | 2006-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5201229 | 2006-04-12 | Paper |
| On partial randomness | 2005-12-29 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| Is complexity a source of incompleteness? | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3022284 | 2005-06-23 | Paper |
| Randomness relative to Cantor expansions | 2005-05-12 | Paper |
| Generalisations of disjunctive sequences | 2005-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662846 | 2005-03-30 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737891 | 2004-08-11 | Paper |
| A fast natural algorithm for searching | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474149 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430291 | 2003-10-20 | Paper |
| The Poincaré-Hardy Inequality on the Complement of a Cantor Set | 2003-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4806962 | 2003-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4805390 | 2003-05-14 | Paper |
| Randomness on full shift spaces | 2003-04-28 | Paper |
| Entropic measures, Markov information sources and complexity | 2003-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152812 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152804 | 2002-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542631 | 2002-08-04 | Paper |
| Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. | 2002-07-31 | Paper |
| A characterization of c. e. random reals | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776458 | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770667 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708951 | 2001-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2702578 | 2001-10-21 | Paper |
| Recursively enumerable reals and Chaitin \(\Omega\) numbers | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2724078 | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942041 | 2001-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2702577 | 2001-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520272 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520316 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520322 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520520 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520527 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495394 | 2001-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782099 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938551 | 2000-09-15 | Paper |
| Finite nondeterministic automata: simulation and minimality | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942241 | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955604 | 2000-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953366 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942046 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941163 | 2000-02-29 | Paper |
| The constructive implicit function theorem and applications in mechanics | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234508 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234510 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223782 | 1999-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3837995 | 1998-08-02 | Paper |
| Deterministic automata. Simulation, universality and minimality | 1998-06-11 | Paper |
| Physical versus computational complementarity. I | 1998-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381402 | 1998-04-01 | Paper |
| Language-theoretic complexity of disjunctive sequences | 1998-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370228 | 1998-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355686 | 1997-11-20 | Paper |
| Effective category and measure in abstract complexity theory | 1997-02-28 | Paper |
| Is independence an exception? | 1995-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326782 | 1995-03-23 | Paper |
| On recursive bounds for the exceptional values in speed-up | 1994-09-25 | Paper |
| RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS | 1994-06-08 | Paper |
| Theories of computational complexity | 1993-06-05 | Paper |
| Note on the topological structure of random strings | 1993-05-24 | Paper |
| Relativized topological size of sets of partial recursive functions | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3982090 | 1992-06-26 | Paper |
| Determining and stationary sets for some classes of partial recursive functions | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357544 | 1990-01-01 | Paper |
| On a theorem of Günter Asser | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358732 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827541 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827996 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3799996 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819058 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207421 | 1988-01-01 | Paper |
| Super-exponentials nonprimitive recursive, but rudimentary | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768894 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026989 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714070 | 1985-01-01 | Paper |
| A combinatorial characterization of sequential p. martin-löf tests | 1985-01-01 | Paper |
| A relation between correctness and randomness in the computation of probabilistic algorithms | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310599 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310600 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318760 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318763 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326421 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665095 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187268 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671142 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674355 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3755445 | 1982-01-01 | Paper |
| Strong noncomputability of random strings | 1982-01-01 | Paper |
| Topological Size of Sets of Partial Recursive Functions | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3958447 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3958448 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4742507 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3927226 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3928265 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3937382 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969867 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3887446 | 1980-01-01 | Paper |
| The first example of a recursive function which is not primitive recursive | 1979-01-01 | Paper |
| On topologies generated by Moisil resemblance relations | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907118 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4159040 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182487 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190626 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116437 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131043 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4163205 | 1977-01-01 | Paper |
| On metrizability of the free monoids | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4107940 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116431 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116488 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4180934 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4057635 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4766602 | 1973-01-01 | Paper |
