Results 21 to 30 of about 29,432 (243)
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
Combinatorial interpretation of Kolmogorov complexity [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrei Romashchenko +2 more
openaire +2 more sources
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
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
Kolmogorov Complexity and the Recursion Theorem [PDF]
Transactions of the American Mathematical Society, 2006 Several classes of diagonally nonrecursive (DNR) functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A A
Bjørn Kjos-Hanssen +2 more
openaire +4 more sources
Quantum Kolmogorov Complexity and Information-Disturbance Theorem
Entropy, 2011 In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vit´anyi has been examined. In the quantum information theory, the information-disturbance relationship, which treats
Takayuki Miyadera
doaj +1 more source
Increasing Kolmogorov Complexity [PDF]
, 2005 How much do we have to change a string to increase its Kolmogorov complexity? We show that we can increase the complexity of any non-random string of length n by flipping $O(\sqrt{n})$ bits and some strings require $\Omega(\sqrt{n})$ bit flips. For a given m, we also give bounds for increasing the complexity of a string by flipping m bits.
H.M. Buhrman (Harry) +3 more
openaire +3 more sources
A Strange Application of Kolmogorov Complexity [PDF]
Theory of Computing Systems, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Hammer, Alexander Shen 0001
openaire +2 more sources
SECOND QUANTIZED KOLMOGOROV COMPLEXITY [PDF]
International Journal of Quantum Information, 2008 The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantized Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this complexity's basic properties.
Rogers, C, Vedral, V, Nagarajan, R
openaire +4 more sources
Reductions to the set of random strings: The resource-bounded case [PDF]
Logical Methods in Computer Science, 2014 This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings.
Eric Allender +3 more
doaj +1 more source