A generalization of Levin-Schnorr's theorem
Keita Yokoyama

TL;DR
This paper generalizes the concept of partial randomness and complexity in reals, establishing a duality between randomness and complexity through a generalized Levin-Schnorr theorem, and explores arithmetic-based randomness via relativization.
Contribution
It introduces a broader definition of partial randomness and complexity, and proves a generalized Levin-Schnorr duality theorem, expanding understanding of randomness in arithmetic contexts.
Findings
Established a generalized Levin-Schnorr duality theorem
Extended the definition of partial randomness and complexity
Analyzed randomness using relativization to $ ext{Pi}^0_1$-classes
Abstract
In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of arithmetic using the relativization to a complete -class.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · DNA and Biological Computing
