The following pages link to Cristian S. Calude (Q235567):
Displaying 50 items.
- Automatic verification of sequential infinite-state processes (Q1377904) (← links)
- Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
- Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
- Finite nondeterministic automata: simulation and minimality (Q1575547) (← links)
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. (Q1607291) (← links)
- Mutual dimension and random sequences (Q1637218) (← links)
- QUBO formulations for the graph isomorphism problem and related problems (Q1682856) (← links)
- The complexity of translationally invariant spin chains with low local dimension (Q1683948) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- Approximation representations for \(\Delta_2\) reals (Q1762732) (← links)
- Randomness relative to Cantor expansions (Q1776777) (← links)
- Finite-state independence (Q1787949) (← links)
- Liouville, computable, Borel normal and Martin-Löf random numbers (Q1787950) (← links)
- Is independence an exception? (Q1805264) (← links)
- Entropic measures, Markov information sources and complexity (Q1855845) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- The weak density of properly d-r. e. branching degree in the d-r. e. degrees (Q1961645) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- A new quantum random number generator certified by value indefiniteness (Q1998859) (← links)
- Normalized information distance and the oscillation hierarchy (Q2051851) (← links)
- Incompleteness and the halting problem (Q2062219) (← links)
- Bi-immunity over different size alphabets (Q2243580) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- Descriptive complexity of computable sequences revisited (Q2290652) (← links)
- Polylog depth, highness and lowness for E (Q2304528) (← links)
- Shift-invariant topologies for the Cantor space \(X^{\omega}\) (Q2357113) (← links)
- Computing discrepancies of Smolyak quadrature rules (Q2365409) (← links)
- Is complexity a source of incompleteness? (Q2386137) (← links)
- Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines (Q2420575) (← links)
- Finite-state independence and normal sequences (Q2424666) (← links)
- Lowness properties and approximations of the jump (Q2478546) (← links)
- Most programs stop quickly or never halt (Q2482913) (← links)
- On partial randomness (Q2576938) (← links)
- Extracting randomness within a subset is hard (Q2663792) (← links)
- (Q2702577) (← links)
- (Q2702578) (← links)
- (Q2708951) (← links)
- (Q2724078) (← links)
- (Q2770667) (← links)
- (Q2776458) (← links)
- Universality and Almost Decidability (Q2805447) (← links)
- Incompleteness, Undecidability and Automated Proofs (Q2829997) (← links)
- INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS (Q2856020) (← links)
- STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY (Q2909179) (← links)
- Introduction: computability of the physical (Q2919936) (← links)
- On the Unpredictability of Individual Quantum Measurement Outcomes (Q2947166) (← 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)
- (Q3022284) (← links)
- (Q3026989) (← links)