Results 241 to 250 of about 2,032,124 (281)

Empirical Kolmogorov Complexity

2018 Information Theory and Applications Workshop (ITA), 2018
The Kolmogorov complexity of a string is the shortest program that outputs that string, and, as such, it provides a deterministic measure of the amount of information within the string that is related, but independent of, Shannon entropy. In practice, this complexity measure is uncomputable and mainly useful for deriving theoretical bounds.
openaire   +1 more source

Diagnosis of Schizophrenia using Kolmogorov Complexity and Sample Entropy

IEEE International Conference on Electronics, Computing and Communication Technologies, 2020
Electroencephalogram (EEG) is known to be the least expensive means to record cerebral activities and anomalies. One on one sessions between the patient and the expert and the expert’s analysis on the patient’s mental condition based on Positive And ...
Shreya Prabhu K, Roshan Joy Martis
semanticscholar   +1 more source

Entropy and Kolmogorov Complexity

2016
This thesis is dedicated to studying the theory of entropy and its relation to the Kolmogorov complexity. Originating in physics, the notion of entropy was introduced to mathematics by C. E. Shannon as a way of measuring the rate at which information is coming from a data source.
openaire   +3 more sources

Kolmogorov Complexity Characterizes Statistical Zero Knowledge

Electron. Colloquium Comput. Complex.
We show that a decidable promise problem has a non-interactive statistical zero-knowledge proof system if and only if it is randomly reducible via an honest polynomial-time reduction to a promise problem for Kolmogorov-random strings, with a ...
Eric Allender, Shuichi Hirahara, Harsha Tirumala   +2 more
semanticscholar   +1 more source

Calculating Kolmogorov Complexity from the Transcriptome Data

International Conference on Intelligent Computing, 2017
Information entropy is used to summarize transcriptome data, but ignoring zero count data contained them. Ignoring zero count data causes loss of information and sometimes it was difficult to distinguish between multiple transcriptomes. Here, we estimate
Panpaki Seekaki, N. Ogata
semanticscholar   +1 more source

One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions

Annual International Cryptology Conference, 2023
Yanyi Liu, R. Pass
semanticscholar   +1 more source

Random noise increases Kolmogorov complexity and Hausdorff dimension

Symposium on Theoretical Aspects of Computer Science, 2018
Consider a bit string x of length n and Kolmogorov complexity αn (for some α < 1). It is always possible to increase the complexity of x by changing a small fraction of bits in x [2]. What happens with the complexity of x when we randomly change each bit
Gleb Posobin, A. Shen
semanticscholar   +1 more source

Kolmogorov complexity, Optimization and Hardness

2006 IEEE International Conference on Evolutionary Computation, 2006
The Kolmogorov complexity (KC) of a string is defined as the length of the shortest program that can print that string and halts. This measure of complexity is often used in optimization to indicate expected function difficulty. While it is often used, there are known counterexamples.
Yossi Borenstein, Riccardo Poli
openaire   +1 more source

Improved Learning from Kolmogorov Complexity

Electron. Colloquium Comput. Complex., 2023
H. Goldberg, Valentine Kabanets
semanticscholar   +1 more source

Kolmogorov Complexity Cores

2010
We study the relationship between complexity cores of a language and the descriptional complexity of the characteristic sequence of the language based on Kolmogorov complexity. We prove that a recursive set A has a complexity core if for all constants c, the computational depth (the difference between time-bounded and unbounded Kolmogorov ...
openaire   +1 more source