The following pages link to Turing machines that take advice (Q787674):
Displaying 25 items.
- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds (Q2944904) (← links)
- On the Amount of Nonconstructivity in Learning Recursive Functions (Q3010414) (← links)
- Nonuniform reductions and NP-completeness (Q3304139) (← links)
- How We Think of Computing Today (Q3507474) (← links)
- Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
- Amount of Nonconstructivity in Finite Automata (Q3637360) (← links)
- An observation on probability versus randomness with applications to complexity classes (Q4298369) (← links)
- A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity (Q4301636) (← links)
- (Q4612482) (← links)
- On the computational power of discrete Hopfield nets (Q4630262) (← links)
- (Q4638059) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- (Q5089196) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)
- (Q5092470) (← links)
- On complexity classes and algorithmically random languages (Q5096791) (← links)
- Inductive counting below logspace (Q5096885) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Effective guessing has unlikely consequences (Q6109068) (← links)
- Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)
- Two-Way Non-Uniform Finite Automata (Q6169962) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)
