Results 31 to 40 of about 2,032,124 (281)
On One-way Functions and Kolmogorov Complexity [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial $t(n)\geq(1+\varepsilon)n,\ \varepsilon > 0$, the following are equivalent: •One-way functions exists (which in turn is equivalent to the existence
Yanyi Liu, R. Pass
semanticscholar +1 more source
Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis
Entropy, 2021 Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object.
Amirmohammad Farzaneh +2 more
doaj +1 more source
Computing Complexity-aware Plans Using Kolmogorov Complexity [PDF]
IEEE Conference on Decision and Control, 2021 In this paper, we introduce complexity-aware planning for finite-horizon deterministic finite automata with rewards as outputs, based on Kolmogorov complexity.
Elis Stefansson, K. Johansson
semanticscholar +1 more source
Second quantised information distance
IET Quantum Communication, 2023 The Kolmogorov complexity of a string is the minimum length of a programme that can produce that string. Information distance between two strings based on Kolmogorov complexity is defined as the minimum length of a programme that can transform either ...
Songsong Dai
doaj +1 more source
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications [PDF]
IEEE Annual Symposium on Foundations of Computer ScienceThe coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content.
Shuichi Hirahara +2 more
semanticscholar +1 more source
Information Complexity Ranking: A New Method of Ranking Images by Algorithmic Complexity
Entropy, 2023 Predicting how an individual will perceive the visual complexity of a piece of information is still a relatively unexplored domain, although it can be useful in many contexts such as for the design of human–computer interfaces.
Thomas Chambon +2 more
doaj +1 more source
LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity [PDF]
Papers in Physics, 2013 In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following requirements: 1) to be ...
Santiago Figueira +2 more
doaj +3 more sources
Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
New Zealand Journal of Mathematics, 2021 We survey recent developments related to the Minimum Circuit Size Problem and time-bounded Kolmogorov Complexity.
Eric Allender
semanticscholar +1 more source
Compressibility and Kolmogorov Complexity
Notre Dame Journal of Formal Logic, 2013 In the paper under review, the authors investigated a metric space over \(2^{\omega}\) defined by \(d(x,y)=\overline{\lim}_n \frac{C(x\upharpoonright n|y\upharpoonright n)}{n}\). They prove that, among the others, for any \(\alpha\in [0,1]\), \(d(\alpha\cdot x, \alpha \cdot y)=\alpha\cdot d(x,y)\); and \(2^{\omega}\) is path connected.
Binns, Stephen, Nicholson, Marie
openaire +3 more sources
Combinatorics and Kolmogorov complexity [PDF]
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 2002 The authors investigate combinatorial properties of finite sequences with high Kolmogorov complexity. They also demonstrate the utility of a Kolmogorov complexity method in combinatorial theory by several examples (such as the coin-weighing problem). >
Ming Li 0001, Paul M. B. Vitányi
openaire +1 more source