The following pages link to Jack H. Lutz (Q400420):
Displayed 50 items.
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Computability and complexity in self-assembly (Q537904) (← links)
- Curves that must be retraced (Q550254) (← links)
- A divergence formula for randomness and dimension (Q616503) (← links)
- Effective dimensions and relative frequencies (Q650901) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← links)
- Inseparability and strong hypotheses for disjoint NP pairs (Q693061) (← links)
- Approximate self-assembly of the Sierpinski triangle (Q693068) (← links)
- An upward measure separation theorem (Q808696) (← links)
- Computability versus exact computability of martingales (Q834952) (← links)
- Strict self-assembly of discrete Sierpinski triangles (Q1004083) (← links)
- On independent random oracles (Q1185000) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- Genericity and randomness over feasible probability measures (Q1275002) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- (Q1361891) (redirect page) (← links)
- Observations on measure and lowness for \(\Delta_ 2^ p\) (Q1361892) (← links)
- Mutual dimension and random sequences (Q1637218) (← links)
- Prediction and dimension (Q1780452) (← links)
- Recursive computational depth. (Q1854307) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Finite-state dimension (Q1884962) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- The global power of additional queries to random oracles (Q1898477) (← links)
- Completeness and weak completeness under polynomial-size circuits (Q1917077) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Modeling time-bounded prefix Kolmogorov complexity (Q1974444) (← links)
- Computing absolutely normal numbers in nearly linear time (Q2051782) (← links)
- The frequent paucity of trivial strings (Q2252648) (← links)
- Dimension characterizations of complexity classes (Q2269007) (← links)
- Robust biomolecular finite automata (Q2306018) (← links)
- Dimensions of Copeland-Erdös sequences (Q2381501) (← links)
- Real-time computability of real numbers by chemical reaction networks (Q2400944) (← links)
- Why computational complexity requires stricter martingales (Q2432539) (← links)
- Finite-state dimension and real arithmetic (Q2461795) (← links)
- Pseudorandom sources for BPP (Q2641105) (← links)
- (Q2754206) (← links)
- Reachability Problems for Continuous Chemical Reaction Networks (Q2819133) (← links)
- Mutual Dimension (Q2832303) (← links)
- Curves That Must Be Retraced (Q2917344) (← links)
- (Q2957876) (← links)
- (Q3046719) (← links)
- Axiomatizing Resource Bounds for Measure (Q3091445) (← links)
- Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
- Intrinsic Universality in Self-Assembly (Q3113756) (← links)
- Inseparability and Strong Hypotheses for Disjoint NP Pairs. (Q3113766) (← links)
- A Pseudorandom Oracle Characterization of ${\text{BPP}}$ (Q3142596) (← links)
- Effective fractal dimensions (Q3159402) (← links)