Pages that link to "Item:Q4075448"
From MaRDI portal
The following pages link to Optimal enumerations and optimal gödel numberings (Q4075448):
Displaying 17 items.
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega (Q736609) (← links)
- Toward an abstract theory of data compression (Q794162) (← links)
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- A note on natural complete sets and Goedel numberings (Q1163015) (← links)
- The extent and density of sequences within the minimal-program complexity hierarchies (Q1212360) (← links)
- Approximations to the halting problem (Q1214917) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- Short lists with short programs from programs of functions and strings (Q1694012) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Zipf's law and L. Levin probability distributions (Q2258210) (← links)
- Process complexity and effective random tests (Q2264549) (← links)
- Enumerations including laconic enumerators (Q2410366) (← links)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- Renormalisation and computation II: time cut-off and the Halting Problem (Q2919937) (← links)
- What Percentage of Programs Halt? (Q3448787) (← links)
- Computational complexity of formal translations (Q4057597) (← links)
