Pages that link to "Item:Q1307029"
From MaRDI portal
The following pages link to Classical recursion theory. Vol. II (Q1307029):
Displaying 50 items.
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- Weakly semirecursive sets and r.e. orderings (Q1210140) (← links)
- Investigations on measure-one identification of classes of languages (Q1271312) (← links)
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
- Equality is a jump (Q1292397) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Approximation methods in inductive inference (Q1295388) (← links)
- Splitting theorems and the jump operator (Q1295399) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Learning via queries and oracles (Q1295409) (← links)
- Splitting theorems in recursion theory (Q1314544) (← links)
- The structure of the honest polynomial m-degrees (Q1341316) (← links)
- Recursion theory on the reals and continuous-time computation (Q1349921) (← links)
- An excursion to the Kolmogorov random strings (Q1362331) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- Noisy inference and oracles (Q1390946) (← links)
- The generalized universal law of generalization. (Q1404969) (← links)
- Learning how to separate. (Q1426149) (← links)
- Computability on subsets of metric spaces. (Q1427773) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- Robust learning aided by context (Q1567396) (← links)
- Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759) (← links)
- Structural measures for games and process control in the branch learning model (Q1575709) (← links)
- Classes bounded by incomplete sets (Q1602854) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Inductive inference with additional information. (Q1608312) (← links)
- Jumps of computably enumerable equivalence relations (Q1693042) (← links)
- On the uniform computational content of computability theory (Q1694010) (← links)
- Proof mining and effective bounds in differential polynomial rings (Q1711923) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Algorithmic identification of probabilities is hard (Q1747492) (← links)
- Approximation representations for \(\Delta_2\) reals (Q1762732) (← links)
- Equivalences between learning of data and probability distributions, and their applications (Q1784951) (← links)
- On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
- Some orbits for \({\mathcal E}\) (Q1840464) (← links)
- Learning classes of approximations to non-recursive functions. (Q1853518) (← links)
- The complexity of universal text-learners. (Q1854315) (← links)
- Learning to win process-control games watching game-masters (Q1854518) (← links)
- Degrees of Dowd-type generic oracles (Q1854543) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- PAC learning of probability distributions over a discrete domain. (Q1874385) (← links)
- Trees and learning (Q1878683) (← links)
- Generalized notions of mind change complexity (Q1881221) (← links)
