Pages that link to "Item:Q1334655"
From MaRDI portal
The following pages link to Computational depth and reducibility (Q1334655):
Displaying 23 items.
- Sophistication vs logical depth (Q519900) (← links)
- Depth as randomness deficiency (Q733740) (← links)
- Lowness and logical depth (Q1676317) (← links)
- Limit-depth and DNR degrees (Q1708266) (← links)
- Weakly useful sequences (Q1776400) (← links)
- Recursive computational depth. (Q1854307) (← links)
- Time-bounded Kolmogorov complexity and Solovay functions (Q1946499) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- Computational depth: Concept and applications (Q2368976) (← links)
- Relativized depth (Q2686103) (← links)
- Depth, Highness and DNR Degrees (Q2947871) (← links)
- On the Polynomial Depth of Various Sets of Random Strings (Q3010430) (← links)
- Time-Bounded Kolmogorov Complexity and Solovay Functions (Q3182941) (← links)
- Constant Depth Reducibility (Q3325043) (← links)
- Computing and Verifying Depth Orders (Q4291567) (← links)
- Recursive computational depth (Q4571946) (← links)
- Weakly useful sequences (Q4645195) (← links)
- The limits of depth reduction for arithmetic formulas (Q5259547) (← links)
- DEEP CLASSES (Q5346696) (← links)
- STACS 2005 (Q5710672) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)