A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing—Abridged Version

scholarly article published on 2 July 2018

A Non-Probabilistic Model of Relativised Predictability in Physics

A characterization of c.e. random reals

A combinatorial characterization of sequential p. martin-löf tests

A fast natural algorithm for searching

A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing ⬇️

scholarly article

A machine learning PROGRAM to identify COVID-19 and other diseases from hematology data

scientific article published on 12 June 2021

A note on accelerated Turing machines

A quantum random number generator certified by value indefiniteness

A relation between correctness and randomness in the computation of probabilistic algorithms

scholarly article by Cristian S. Calude & Marius Zimand published January 1984 in International Journal of Computer Mathematics

A topological characterization of random sequences

A variant of the Kochen-Specker theorem localising value indefiniteness ⬇️

AN OBSERVER-BASED DE-QUANTISATION OF DEUTSCH'S ALGORITHM

Algorithmically Independent Sequences

Algorithmically independent sequences

An Empirical Approach to the Normality of π

article

Anytime Algorithms for Non-Ending Computations

scholarly article by Cristian S. Calude & Damien Desfontaines published June 2015 in International Journal of Foundations of Computer Science

Bio-steps beyond Turing

scientific article published in November 2004

CODING WITH MINIMAL PROGRAMS

Can we solve the pipeline problem?

Chaitin Ω numbers, Solovay machines, and Gödel incompleteness

Classical, quantum and biological randomness as relative unpredictability

Computational Complementarity for Probabilistic Automata

Computational complementarity and shift spaces

Computing with New Resources

DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM

Deciding Parity Games in Quasi-polynomial Time ⬇️

scholarly article

Determining and stationary sets for some classes of partial recursive functions

article by Cristian S. Calude & Gabriel Istrate published May 1991 in Theoretical Computer Science

Discrete mathematical structures: From dynamics to complexity

article

EXACT APPROXIMATIONS OF OMEGA NUMBERS

East-West paths to unconventional computing.

scientific article published on 14 August 2017

Effective category and measure in abstract complexity theory

Entropic measures, Markov information sources and complexity

Experimental evidence of quantum randomness incomputability

article

Experimentally probing the algorithmic randomness and incomputability of quantum randomness

scholarly article

Finite Versus Infinite

Finite nondeterministic automata: Simulation and minimality

scholarly article

Finite state complexity

Foreword

Formal Proof: Reconciling Correctness and Understanding

From Heisenberg to Gödel via Chaitin

Generalisations of disjunctive sequences

INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS

INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM

article by Cristian S. Calude et al published March 2013 in Parallel Processing Letters

Inductive Complexity of P versus NP Problem

article by Cristian S. Calude et al published 2012 in Lecture Notes in Computer Science

Infinitesimal Probabilities Based on Grossone ⬇️

scholarly article

Information and Randomness

Information and Randomness

article

Information: The Algorithmic Paradigm

Introduction

Introduction: computability of the physical

Is Feasibility in Physics Limited by Fantasy Alone?

Is complexity a source of incompleteness?

article published in 2005

Is independence an exception?

Is the Universe Random?

Is there a universal image generator?

Liouville, Computable, Borel Normal and Martin-Löf Random Numbers

scientific article published in 2017

Most programs stop quickly or never halt

Natural halting probabilities, partial randomness, and zeta functions

article by Cristian S. Calude et al published November 2006 in Information and Computation

Note on the topological structure of random strings

On metrizability of the free monoids

On partial randomness

article by Cristian S. Calude et al published March 2006 in Annals of Pure and Applied Logic

On recursive bounds for the exceptional values in speed-up

On the Unpredictability of Individual Quantum Measurement Outcomes ⬇️

On topologies generated by Moisil resemblance relations

On universal computably enumerable prefix codes

PREFACE

Parallel thinking

scientific article published in Nature

Physical versus computational complementarity. I

Preface

Preface

Preface

Preface to the Special Issue Unconventional Computing 2008

Preface to the Special Issue on Physics and Computation “Towards a Computational Interpretation of Physical Theories”

Quantum Information with Meaning Inside and Outside the Quantum

Quantum Molinism

scientific article published on 22 October 2022

Quantum Randomness and Value Indefiniteness ⬇️

article published in 2008

Randomness everywhere

scientific article published in Nature

Randomness on full shift spaces☆

article published in 2001

Randomness relative to Cantor expansions

Recursively enumerable reals and Chaitin Ω numbers

Recursively enumerable reals and chaitin Ω numbers

Relativized topological size of sets of partial recursive functions

Representation of left-computable ε-random reals

scientific article published in July 2011

STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY

Searching for shortest and least programs ⬇️

scholarly article

Simplicity via provability for universal prefix-free Turing machines

Solomon Marcus Contributions to Theoretical Computer Science and Applications

scientific article published in 2021

Strong Kochen-Specker theorem and incomputability of quantum randomness

Super-exponentials nonprimitive recursive, but rudimentary

The Deluge of Spurious Correlations in Big Data

The complexity of Euler’s integer partition theorem

article by Cristian S. Calude et al published October 2012 in Theoretical Computer Science

The complexity of proving chaoticity and the Church-Turing thesis

scientific article published in September 2010

The first example of a recursive function which is not primitive recursive

Topology on words

Unconventional Computation and Natural Computation

Universal Recursively Enumerable Sets of Strings

Universal recursively enumerable sets of strings

scientific article published in May 2011

Value-indefinite observables are almost everywhere

article by Alastair A. Abbott et al published 10 March 2014 in Physical Review A

Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits