The following pages link to Cristian S. Calude (Q235567):
Displaying 25 items.
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- The complexity of Euler's integer partition theorem (Q714811) (← links)
- Super-exponentials nonprimitive recursive, but rudimentary (Q1095134) (← links)
- Note on the topological structure of random strings (Q1210302) (← links)
- On metrizability of the free monoids (Q1230512) (← links)
- On topologies generated by Moisil resemblance relations (Q1260388) (← links)
- Finite-state independence (Q1787949) (← links)
- On partial randomness (Q2576938) (← links)
- (Q2770667) (← links)
- INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS (Q2856020) (← links)
- STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY (Q2909179) (← links)
- Anytime Algorithms for Non-Ending Computations (Q2947801) (← links)
- Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits (Q3007703) (← links)
- A note on accelerated Turing machines (Q3061156) (← links)
- Every computably enumerable random real is provably computably enumerable random (Q3391740) (← links)
- Universal Recursively Enumerable Sets of Strings (Q3533008) (← links)
- Information: The Algorithmic Paradigm (Q3627409) (← links)
- Formal Proof: Reconciling Correctness and Understanding (Q3637280) (← links)
- Generalisations of disjunctive sequences (Q4666941) (← links)
- An Empirical Approach to the Normality of π (Q4908503) (← links)
- INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM (Q5408361) (← links)
- A quantum random number generator certified by value indefiniteness (Q5740359) (← links)
- A characterization of c. e. random reals (Q5958278) (← links)
