Results 31 to 40 of about 1,622,352 (271)
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
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
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
Probabilistic Kolmogorov complexity with applications to average-case complexity [PDF]
, 2022 Understanding the relationship between the worst-case and average-case complexities of NP and of other subclasses of PH is a long-standing problem in complexity theory.
Oliveira, Igor C. +3 more
core +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
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
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
Kolmogorov complexity and probability measures [PDF]
, 2002 summary:Classes of strings (infinite sequences resp.) with a specific flow of Kolmogorov complexity are introduced. Namely, lower bounds of Kolmogorov complexity are prescribed to strings (initial segments of infinite sequences resp.) of specified ...
Boček, Pavel, Šindelář, Jan
core +1 more source
Testing the Complexity of a Valued CSP Language [PDF]
, 2019 A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be
Kolmogorov, Vladimir
core +1 more source
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