Showing 1–20 of 61 results
/ Date/ Name
Aug 30, 2023Conditional automatic complexity and its metricsAug 12, 2014Martin-Löf randomness and Galton-Watson processesAug 12, 2014Infinite subsets of random sets of integersFeb 3, 2020From eventually different functions to pandemic numberingsJan 7, 2020VC-dimensions of nondeterministic finite automata for words of equal lengthApr 28, 2021KL-randomness and effective dimension under strong reducibilityMar 15, 2017Superposition as memory: unlocking quantum automatic complexityFeb 11, 2016Constructing a weak subset of a random setOct 9, 2025Languages of Words of Low Automatic Complexity Are Hard to ComputeApr 20, 2026Classification and deontic explosion for contrary-to-duty obligationsJan 25, 2009Lattice initial segments of the Turing degreesJan 27, 2009Google distance between wordsJun 21, 2022Maximal automatic complexity and context-free languagesAug 15, 2019A tractable case of the Turing automorphism problem: bi-uniformly $E_0$-invariant Cantor homeomorphismsAug 26, 2019An incompressibility theorem for automatic complexityFeb 11, 2014Algorithmic aspects of Lipschitz functionsAug 8, 2014A strong law of computationally weak subsetsAug 10, 2014The Strength of the Grätzer-Schmidt TheoremMar 1, 2026Unbounded length minimal synchronizing words for quantum channels over qutritsAug 28, 2020A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations