New answers tagged kolmogorov-complexity
2
votes
A potentially novel complexity measure for sets of strings
One possible measure of the "complexity" of a set of strings is the size of the minimal DFA that accepts exactly those strings (and no others). I can't tell whether this has the properties ...
Top 50 recent answers are included
Related Tags
kolmogorov-complexity × 95cc.complexity-theory × 26
it.information-theory × 20
reference-request × 13
computability × 11
turing-machines × 10
lo.logic × 6
ds.algorithms × 5
fl.formal-languages × 4
universal-computation × 4
universal-turing-machines × 4
circuit-complexity × 3
randomness × 3
average-case-complexity × 3
optimization × 2
quantum-computing × 2
time-complexity × 2
polynomial-time × 2
parameterized-complexity × 2
complexity × 2
ai.artificial-intel × 2
upper-bounds × 2
descriptive-complexity × 2
shannon-entropy × 2
co.combinatorics × 1