Conditional automatic complexity and its metrics

DOI10.1007/978-3-031-49190-0_2MaRDI QIDQ6591454zbMATH OpenFDO

Authors Bjørn Kjos-Hanssen

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49190-0_2

zbMATH Keywords

automatic complexityJaccard distanceKolmogorov complexity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A note on entropy metrics
• A Second Course in Formal Languages and Automata Theory
• Algorithmic statistics
• An incompressibility theorem for automatic complexity
• Automatic complexity of shift register sequences
• Few Paths, Fewer Words: Model Selection With Automatic Structure Functions
• scientific article; zbMATH DE number 1747450 (Why is no real title available?)
• Interpolating between the Jaccard distance and an analogue of the normalized information distance
• Nondeterministic automatic complexity of overlap-free and almost square-free words
• The equation \(a_ M=b^ Nc^ P\) in a free group
• The lattice theory of information
• The Similarity Metric

This page was built for publication: Conditional automatic complexity and its metrics

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