The following pages link to Cristian S. Calude (Q235567):
Displaying 50 items.
- (Q197707) (redirect page) (← links)
- Finite state incompressible infinite sequences (Q259039) (← links)
- Coherent randomness tests and computing the \(K\)-trivial sets (Q277530) (← links)
- Characterizing strong randomness via Martin-Löf randomness (Q409318) (← links)
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective (Q494067) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- Morphic characterizations of languages in Chomsky hierarchy with insertion and locality (Q553307) (← links)
- A fast natural algorithm for searching (Q596119) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- (Q672751) (redirect page) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- If not empty, NP-P is topologically large (Q688157) (← links)
- The complexity of Euler's integer partition theorem (Q714811) (← links)
- Representation of left-computable \(\varepsilon \)-random reals (Q716316) (← links)
- Finite state complexity (Q719308) (← links)
- A non-ergodic probabilistic cellular automaton with a unique invariant measure (Q719767) (← links)
- Determining and stationary sets for some classes of partial recursive functions (Q757357) (← links)
- Handbook of weighted automata (Q836989) (← links)
- Natural halting probabilities, partial randomness, and zeta functions (Q859830) (← links)
- On the definable ideal generated by the plus cupping c.e. degrees (Q877264) (← links)
- The isomorphism problem for torsion-free abelian groups is analytic complete (Q952542) (← links)
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees (Q958483) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Computational complementarity and shift spaces (Q997483) (← links)
- Topology on words (Q1019711) (← links)
- A topological characterization of random sequences (Q1029024) (← links)
- Super-exponentials nonprimitive recursive, but rudimentary (Q1095134) (← links)
- (Q1125118) (redirect page) (← links)
- The constructive implicit function theorem and applications in mechanics (Q1125119) (← links)
- The first example of a recursive function which is not primitive recursive (Q1135847) (← links)
- Relativized topological size of sets of partial recursive functions (Q1177145) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Calculate categorically! (Q1203123) (← links)
- Weakly semirecursive sets and r.e. orderings (Q1210140) (← links)
- Note on the topological structure of random strings (Q1210302) (← links)
- Theories of computational complexity (Q1210716) (← links)
- On metrizability of the free monoids (Q1230512) (← links)
- On topologies generated by Moisil resemblance relations (Q1260388) (← links)
- (Q1295407) (redirect page) (← links)
- Coding a family of sets (Q1295408) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- Classical recursion theory. Vol. II (Q1307029) (← links)
- Information categories (Q1320330) (← links)
- On the Kolmogorov complexity of arbitrary objects (Q1330149) (← links)
- On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
- Physical versus computational complementarity. I (Q1376456) (← links)
- Deterministic automata. Simulation, universality and minimality (Q1377610) (← links)
