Pages that link to "Item:Q2921012"
From MaRDI portal
The following pages link to Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity (Q2921012):
Displaying 12 items.
- Relating and contrasting plain and prefix Kolmogorov complexity (Q285520) (← links)
- A note on the number of \(N\)-bit strings with maximum complexity (Q1316114) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Proofs of conservation inequalities for Levin's notion of mutual information of 1974 (Q2219055) (← links)
- The frequent paucity of trivial strings (Q2252648) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- Topological arguments for Kolmogorov complexity (Q2354581) (← links)
- Systems of strings with high mutual complexity (Q2388462) (← links)
- Enumerations including laconic enumerators (Q2410366) (← links)
- List approximation for increasing Kolmogorov complexity (Q4636659) (← links)
- The Normalized Algorithmic Information Distance Can Not Be Approximated (Q5042235) (← links)
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)'' (Q5958283) (← links)
