Relativized depth
From MaRDI portal
Publication:2686103
Recommendations
Cites work
- A Theory of Program Size Formally Identical to Information Theory
- Algorithmic randomness and complexity.
- Computability and randomness
- Computational depth and reducibility
- Depth, highness and DNR degrees
- Every sequence is reducible to a random one
- scientific article; zbMATH DE number 4093436 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1543065 (Why is no real title available?)
- scientific article; zbMATH DE number 2236645 (Why is no real title available?)
- Limit complexities revisited
- Lowness properties and randomness
- Mass Problems and Randomness
- On the construction of effectively random sets
- On the relation between descriptional complexity and algorithmic probability
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- The importance of \(\Pi^0_1\) classes in effective randomness
- Two-Tape Simulation of Multitape Turing Machines
Cited in
(12)- Lowness and logical depth
- Limit-depth and DNR degrees
- On the polynomial depth of various sets of random strings
- Depth relevance and hyperformalism
- An almost deep degree
- Depth, highness and DNR degrees
- The fundamental difference between depth and delay
- Depth, highness and DNR degrees
- Deep _1⁰ classes
- Feasible Depth
- Relativized depth
- Bridging computational notions of depth
This page was built for publication: Relativized depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686103)