| Publication | Date of Publication | Type |
|---|
| Quantum randomness: from practice to theory and back | 2024-09-06 | Paper |
How real is incomputability in physics?
Theoretical Computer Science | 2024-06-04 | Paper |
What perceptron neural networks are (not) good for?
Information Sciences | 2024-04-18 | Paper |
Randomness as an invariant for number representations
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Long and short proofs | 2023-06-02 | Paper |
Effective category and measure in abstract complexity theory
Fundamentals of Computation Theory | 2022-12-09 | Paper |
LIARS, DEMONS, AND CHAOS
Words, Semigroups, and Transductions | 2022-12-06 | Paper |
Deciding Parity Games in Quasi-polynomial Time
SIAM Journal on Computing | 2022-05-03 | Paper |
| To Halt or Not to Halt? That Is the Question | 2022-04-04 | Paper |
Incompleteness and the halting problem
Studia Logica | 2021-12-27 | Paper |
Bi-immunity over different size alphabets
Theoretical Computer Science | 2021-11-11 | Paper |
Quantum solutions for densest \(k\)-subgraph problems
Journal of Membrane Computing | 2021-09-14 | Paper |
A new quantum random number generator certified by value indefiniteness
Theoretical Computer Science | 2021-03-09 | Paper |
| Finite-state complexity and the size of transducers | 2021-02-24 | Paper |
Finite-state complexity and the size of transducers
(available as arXiv preprint) | 2021-02-24 | Paper |
| Understanding the quantum computational speed-up via de-quantisation | 2021-02-16 | Paper |
| Simplicity via provability for universal prefix-free Turing machines | 2021-01-20 | Paper |
A statistical anytime algorithm for the halting problem
Computability | 2020-11-09 | Paper |
The road to quantum computational supremacy
Springer Proceedings in Mathematics & Statistics | 2020-07-21 | Paper |
Searching for shortest and least programs
Theoretical Computer Science | 2020-01-22 | Paper |
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
International Journal of Quantum Information | 2020-01-08 | Paper |
| scientific article; zbMATH DE number 7075915 (Why is no real title available?) | 2019-07-03 | Paper |
Liouville, computable, Borel normal and Martin-Löf random numbers
Theory of Computing Systems | 2018-10-05 | Paper |
A probabilistic anytime algorithm for the halting problem
Computability | 2018-09-20 | Paper |
| A simple construction of absolutely disjunctive Liouville numbers | 2018-09-17 | Paper |
QUBO formulations for the graph isomorphism problem and related problems
Theoretical Computer Science | 2017-12-06 | Paper |
Deciding parity games in quasipolynomial time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Incompleteness, Undecidability and Automated Proofs
Computer Algebra in Scientific Computing | 2016-11-09 | Paper |
A quantum random number generator certified by value indefiniteness
Mathematical Structures in Computer Science | 2016-07-26 | Paper |
Universality and almost decidability
Fundamenta Informaticae | 2016-05-11 | Paper |
Finite state incompressible infinite sequences
Information and Computation | 2016-03-10 | Paper |
A variant of the Kochen-Specker theorem localising value indefiniteness
Journal of Mathematical Physics | 2015-11-06 | Paper |
Anytime algorithms for non-ending computations
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
On the Unpredictability of Individual Quantum Measurement Outcomes
Fields of Logic and Computation II | 2015-09-22 | Paper |
The complexity of proving chaoticity and the Church-Turing thesis
Chaos: An Interdisciplinary Journal of Nonlinear Science | 2015-05-19 | Paper |
Coding with minimal programs
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
Finite State Incompressible Infinite Sequences
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Inductive complexity of the P versus NP problem
Parallel Processing Letters | 2014-04-10 | Paper |
Inductive complexity measures for mathematical problems
International Journal of Foundations of Computer Science | 2013-10-23 | Paper |
Spectral representation of some computably enumerable sets with an application to quantum provability
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
An empirical approach to the normality of \(\pi\)
Experimental Mathematics | 2013-03-06 | Paper |
Is feasibility in physics limited by fantasy alone?
A Computable Universe | 2013-02-26 | Paper |
The universe is lawless or ``Pantôn chrêmatôn metron anthrôpon einai''
A Computable Universe | 2013-02-26 | Paper |
Von Neumann normalisation of a quantum random number generator
Computability | 2013-01-30 | Paper |
| scientific article; zbMATH DE number 6131559 (Why is no real title available?) | 2013-01-28 | Paper |
| scientific article; zbMATH DE number 6131587 (Why is no real title available?) | 2013-01-28 | Paper |
| scientific article; zbMATH DE number 6131595 (Why is no real title available?) | 2013-01-28 | Paper |
| scientific article; zbMATH DE number 6131609 (Why is no real title available?) | 2013-01-28 | Paper |
| scientific article; zbMATH DE number 6131657 (Why is no real title available?) | 2013-01-28 | Paper |
Inductive complexity of P versus NP problem (extended abstract)
Unconventional Computation and Natural Computation | 2012-11-08 | Paper |
Introduction to the special issue: Computability of the physical
MSCS. Mathematical Structures in Computer Science | 2012-10-23 | Paper |
The complexity of Euler's integer partition theorem
Theoretical Computer Science | 2012-10-11 | Paper |
State-size hierarchy for finite-state complexity
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Is there a universal image generator?
Applied Mathematics and Computation | 2012-08-19 | Paper |
| scientific article; zbMATH DE number 6019535 (Why is no real title available?) | 2012-03-29 | Paper |
Finite state complexity
Theoretical Computer Science | 2011-10-10 | Paper |
The complexity of the four colour theorem
LMS Journal of Computation and Mathematics | 2011-09-15 | Paper |
Von Neumann normalisation and symptoms of randomness: an application to sequences of quantum random bits
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Universal recursively enumerable sets of strings
Theoretical Computer Science | 2011-05-10 | Paper |
Representation of left-computable \(\varepsilon \)-random reals
Journal of Computer and System Sciences | 2011-04-28 | Paper |
An observer-based de-quantisation of Deutsch's algorithm
International Journal of Foundations of Computer Science | 2011-02-23 | Paper |
Simplicity via provability for universal prefix-free Turing machines
Theoretical Computer Science | 2011-01-10 | Paper |
A note on accelerated Turing machines
Mathematical Structures in Computer Science | 2010-12-14 | Paper |
| scientific article; zbMATH DE number 5772857 (Why is no real title available?) | 2010-08-18 | Paper |
Algorithmically independent sequences
Information and Computation | 2010-04-14 | Paper |
| scientific article; zbMATH DE number 5679774 (Why is no real title available?) | 2010-03-10 | Paper |
| Evaluating the complexity of mathematical problems. I | 2010-03-10 | Paper |
| scientific article; zbMATH DE number 5616409 (Why is no real title available?) | 2009-10-16 | Paper |
scientific article; zbMATH DE number 5604130 (Why is no real title available?)
(available as arXiv preprint) | 2009-09-15 | Paper |
Every computably enumerable random real is provably computably enumerable random
Logic Journal of the IGPL | 2009-08-12 | Paper |
Every computably enumerable random real is provably computably enumerable random
Logic Journal of the IGPL | 2009-08-12 | Paper |
A topological characterization of random sequences
Information Processing Letters | 2009-07-09 | Paper |
Formal Proof: Reconciling Correctness and Understanding
Lecture Notes in Computer Science | 2009-07-09 | Paper |
Topology on words
Theoretical Computer Science | 2009-06-04 | Paper |
Aspects of Molecular Computing
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Information: The Algorithmic Paradigm
Formal Theories of Information | 2009-05-12 | Paper |
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
Universal Recursively Enumerable Sets of Strings
Developments in Language Theory | 2008-10-30 | Paper |
Algorithmically Independent Sequences
Developments in Language Theory | 2008-10-30 | Paper |
EXACT APPROXIMATIONS OF OMEGA NUMBERS
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering | 2008-07-02 | Paper |
Most programs stop quickly or never halt
Advances in Applied Mathematics | 2008-04-28 | Paper |
| Proving and programming | 2008-03-20 | Paper |
| scientific article; zbMATH DE number 5234254 (Why is no real title available?) | 2008-02-11 | Paper |
From Heisenberg to Gödel via Chaitin
International Journal of Theoretical Physics | 2007-11-21 | Paper |
| Additive distances and quasi-distances between words | 2007-10-17 | Paper |
| scientific article; zbMATH DE number 5200708 (Why is no real title available?) | 2007-10-15 | Paper |
Computational complementarity and shift spaces
Chaos, Solitons and Fractals | 2007-08-06 | Paper |
DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM
International Journal of Quantum Information | 2007-06-20 | Paper |
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation | 2007-01-22 | Paper |
| Automata recognizing no words: a statistical approach | 2006-11-21 | Paper |
From Heisenberg to Gödel via Chaitin
International Journal of Theoretical Physics | 2006-09-28 | Paper |
Computing a Glimpse of Randomness
Experimental Mathematics | 2006-06-14 | Paper |
Computing a Glimpse of Randomness
Experimental Mathematics | 2006-06-14 | Paper |
Computing a Glimpse of Randomness
Experimental Mathematics | 2006-06-14 | Paper |
| What is the value of Taxicab(6)? | 2006-04-12 | Paper |
On partial randomness
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Is complexity a source of incompleteness?
Advances in Applied Mathematics | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2182417 (Why is no real title available?) | 2005-06-23 | Paper |
Randomness relative to Cantor expansions
Communications in Nonlinear Science and Numerical Simulation | 2005-05-12 | Paper |
Generalisations of disjunctive sequences
MLQ | 2005-04-07 | Paper |
| scientific article; zbMATH DE number 2150297 (Why is no real title available?) | 2005-03-30 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
| scientific article; zbMATH DE number 2087208 (Why is no real title available?) | 2004-08-11 | Paper |
A fast natural algorithm for searching
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2081043 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1988964 (Why is no real title available?) | 2003-10-20 | Paper |
The Poincaré-Hardy Inequality on the Complement of a Cantor Set
Interpolation Theory, Systems Theory and Related Topics | 2003-09-26 | Paper |
| scientific article; zbMATH DE number 1911266 (Why is no real title available?) | 2003-05-15 | Paper |
scientific article; zbMATH DE number 1909828 (Why is no real title available?)
Minds and Machines | 2003-05-14 | Paper |
Randomness on full shift spaces
Chaos, Solitons and Fractals | 2003-04-28 | Paper |
Entropic measures, Markov information sources and complexity
Applied Mathematics and Computation | 2003-01-28 | Paper |
| scientific article; zbMATH DE number 1820029 (Why is no real title available?) | 2002-12-10 | Paper |
| scientific article; zbMATH DE number 1820021 (Why is no real title available?) | 2002-10-23 | Paper |
| scientific article; zbMATH DE number 1775501 (Why is no real title available?) | 2002-08-04 | Paper |
Chaitin numbers, Solovay machines, and Gödel incompleteness.
Theoretical Computer Science | 2002-07-31 | Paper |
A characterization of c. e. random reals
Theoretical Computer Science | 2002-03-03 | Paper |
| A glimpse into algorithmic information theory | 2002-02-28 | Paper |
Most numbers obey no probability laws
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
| Bisimulations and behaviour of nondeterministic automata | 2001-11-07 | Paper |
Strong determinism vs. computability
(available as arXiv preprint) | 2001-10-21 | Paper |
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1615478 (Why is no real title available?) | 2001-07-09 | Paper |
| scientific article; zbMATH DE number 1418479 (Why is no real title available?) | 2001-05-01 | Paper |
| What is a random string? | 2001-04-24 | Paper |
| scientific article; zbMATH DE number 1543065 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1542867 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1542863 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1543071 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1542825 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1488315 (Why is no real title available?) | 2001-01-29 | Paper |
| scientific article; zbMATH DE number 1836414 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1405572 (Why is no real title available?) | 2000-09-15 | Paper |
Finite nondeterministic automata: simulation and minimality
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1419223 (Why is no real title available?) | 2000-07-20 | Paper |
scientific article; zbMATH DE number 1453809 (Why is no real title available?)
(available as arXiv preprint) | 2000-05-30 | Paper |
| scientific article; zbMATH DE number 1444331 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1418484 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1408348 (Why is no real title available?) | 2000-02-29 | Paper |
The constructive implicit function theorem and applications in mechanics
Chaos, Solitons and Fractals | 1999-11-29 | Paper |
| scientific article; zbMATH DE number 1263583 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1263585 (Why is no real title available?) | 1999-11-03 | Paper |
| scientific article; zbMATH DE number 1236368 (Why is no real title available?) | 1999-03-11 | Paper |
| scientific article; zbMATH DE number 1183247 (Why is no real title available?) | 1998-08-02 | Paper |
Deterministic automata. Simulation, universality and minimality
Annals of Pure and Applied Logic | 1998-06-11 | Paper |
Physical versus computational complementarity. I
International Journal of Theoretical Physics | 1998-06-02 | Paper |
| scientific article; zbMATH DE number 1136091 (Why is no real title available?) | 1998-04-01 | Paper |
Language-theoretic complexity of disjunctive sequences
Discrete Applied Mathematics | 1998-03-25 | Paper |
| scientific article; zbMATH DE number 1104353 (Why is no real title available?) | 1998-02-02 | Paper |
| scientific article; zbMATH DE number 1064118 (Why is no real title available?) | 1997-11-20 | Paper |
Effective category and measure in abstract complexity theory
Theoretical Computer Science | 1997-02-28 | Paper |
Is independence an exception?
Applied Mathematics and Computation | 1995-05-11 | Paper |
| scientific article; zbMATH DE number 736618 (Why is no real title available?) | 1995-03-23 | Paper |
On recursive bounds for the exceptional values in speed-up
Theoretical Computer Science | 1994-09-25 | Paper |
RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS
Mathematical Logic Quarterly | 1994-06-08 | Paper |
Theories of computational complexity
Annals of Discrete Mathematics | 1993-06-05 | Paper |
Note on the topological structure of random strings
Theoretical Computer Science | 1993-05-24 | Paper |
| scientific article; zbMATH DE number 23837 (Why is no real title available?) | 1992-06-26 | Paper |
Relativized topological size of sets of partial recursive functions
Theoretical Computer Science | 1992-06-26 | Paper |
Determining and stationary sets for some classes of partial recursive functions
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4209605 (Why is no real title available?) | 1990-01-01 | Paper |
On a theorem of Günter Asser
Mathematical Logic Quarterly | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4103057 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4102487 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4210137 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4128138 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4066835 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4091490 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4027455 (Why is no real title available?) | 1987-01-01 | Paper |
Super-exponentials nonprimitive recursive, but rudimentary
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4014690 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3941524 (Why is no real title available?) | 1985-01-01 | Paper |
A combinatorial characterization of sequential p. martin-löf tests
International Journal of Computer Mathematics | 1985-01-01 | Paper |
A relation between correctness and randomness in the computation of probabilistic algorithms
International Journal of Computer Mathematics | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3857951 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3849210 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3817693 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3895049 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3839936 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3839937 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3849213 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3823755 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3829572 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 4004169 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3779306 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3779307 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3797448 (Why is no real title available?) | 1982-01-01 | Paper |
Topological Size of Sets of Partial Recursive Functions
Mathematical Logic Quarterly | 1982-01-01 | Paper |
Strong noncomputability of random strings
International Journal of Computer Mathematics | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3742650 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3741368 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3754675 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3793410 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3693256 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3716836 (Why is no real title available?) | 1979-01-01 | Paper |
On topologies generated by Moisil resemblance relations
Discrete Mathematics | 1979-01-01 | Paper |
The first example of a recursive function which is not primitive recursive
Historia Mathematica | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3628939 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3591974 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3619868 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3540796 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3559008 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3596820 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3530989 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3540789 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3540856 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3617151 (Why is no real title available?) | 1976-01-01 | Paper |
On metrizability of the free monoids
Discrete Mathematics | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3473351 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3441630 (Why is no real title available?) | 1973-01-01 | Paper |
