An incompressibility theorem for automatic complexity

DOI10.1017/FMS.2021.58OpenAlexW3199072391MaRDI QIDQ5154787FDOQ5154787

Authors: Bjørn Kjos-Hanssen 

Publication date: 5 October 2021

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.10843

Recommendations

• scientific article; zbMATH DE number 1747450
• On the complexity of automatic complexity
• Automaticity. I: Properties of a measure of descriptional complexity
• Kolmogorov structure functions for automatic complexity
• Automaticity. II: Descriptional complexity in the unary case

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Title not available (Why is that?)
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• Three approaches to the quantitative definition of information^*
• Title not available (Why is that?)
• Complexity of protein folding
• Resource-bounded Kolmogorov complexity revisited
• Nondeterministic automatic complexity of overlap-free and almost square-free words
• On the complexity of automatic complexity
• Few Paths, Fewer Words: Model Selection With Automatic Structure Functions

Cited In (2)

• Conditional automatic complexity and its metrics
• Title not available (Why is that?)

Uses Software

• MathOverflow

This page was built for publication: An incompressibility theorem for automatic complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154787)