zbMath0931.03057MaRDI QIDQ1307029
Piergiorgio Odifreddi
Publication date: 25 October 1999
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
The Medvedev lattice of computably closed sets ⋮
An analog characterization of the Grzegorczyk hierarchy ⋮
The jump operation for structure degrees ⋮
PAC learning of probability distributions over a discrete domain. ⋮
Trees and learning ⋮
Generalized notions of mind change complexity ⋮
The structure of the honest polynomial m-degrees ⋮
Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮
Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees ⋮
Recursion theory on the reals and continuous-time computation ⋮
Strong enumeration reducibilities ⋮
Infinite games specified by 2-tape automata ⋮
An excursion to the Kolmogorov random strings ⋮
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals ⋮
Strongly non-U-shaped language learning results by general techniques ⋮
Computation with perturbed dynamical systems ⋮
Learning recursive functions from approximations ⋮
Classes with easily learnable subclasses ⋮
Undefinability of truth and nonstandard models ⋮
Query languages for bags and aggregate functions ⋮
Extended regular expressions: succinctness and decidability ⋮
An improved zero-one law for algorithmically random sequences ⋮
Natural factors of the Muchnik lattice capturing IPC ⋮
Noisy inference and oracles ⋮
Computational processes, observers and Turing incompleteness ⋮
Streamlined subrecursive degree theory ⋮
Jumps of computably enumerable equivalence relations ⋮
On the uniform computational content of computability theory ⋮
The generalized universal law of generalization. ⋮
Closed choice and a uniform low basis theorem ⋮
Extending and interpreting Post's programme ⋮
The effective theory of Borel equivalence relations ⋮
Games with 1-backtracking ⋮
Analogues of quantum complementarity in the theory of automata ⋮
Proof mining and effective bounds in differential polynomial rings ⋮
Recursion-theoretic ranking and compression ⋮
Learning how to separate. ⋮
Learning recursive functions: A survey ⋮
Learning indexed families of recursive languages from positive data: A survey ⋮
Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮
Computability on subsets of metric spaces. ⋮
Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability ⋮
Derandomization in game-theoretic probability ⋮
Continuous-time computation with restricted integration capabilities ⋮
On the hardness of analyzing probabilistic programs ⋮
\(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly ⋮
\(\mu\)-limit sets of cellular automata from a computational complexity perspective ⋮
Myhill's work in recursion theory ⋮
Fine hierarchies and m-reducibilities in theoretical computer science ⋮
Equational theories for inductive types ⋮
On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data ⋮
Algorithmic identification of probabilities is hard ⋮
Irreducible, singular, and contiguous degrees ⋮
Epistemic entrenchment and arithmetical hierarchy ⋮
Consistent and coherent learning with \(\delta \)-delay ⋮
\(\Pi_1^0 \) classes, LR degrees and Turing degrees ⋮
Random numbers as probabilities of machine behavior ⋮
Nondiamond theorems for polynomial time reducibility ⋮
Non-determinism in Gödel's system \(T\) ⋮
Approximation representations for \(\Delta_2\) reals ⋮
Weakly semirecursive sets and r.e. orderings ⋮
Real recursive functions and their hierarchy ⋮
Decision problems for Turing machines ⋮
Computability on reals, infinite limits and differential equations ⋮
Equivalences between learning of data and probability distributions, and their applications ⋮
Resource restricted computability theoretic learning: Illustrative topics and problems ⋮
Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) ⋮
A new conceptual framework for analog computation ⋮
Investigations on measure-one identification of classes of languages ⋮
Determining and stationary sets for some classes of partial recursive functions ⋮
Achilles and the tortoise climbing up the hyper-arithmetical hierarchy ⋮
The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees ⋮
Robust learning aided by context ⋮
Quasi-minimal enumeration degrees and minimal Turing degrees ⋮
On the computational complexity of Longley's \(H\) functional ⋮
Computations via Newtonian and relativistic kinematic systems ⋮
Structural measures for games and process control in the branch learning model ⋮
Equality is a jump ⋮
Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮
Index sets in computable analysis ⋮
On approximate and algebraic computability over the real numbers ⋮
The noneffectivity of Arslanov's completeness criterion and related theorems ⋮
Index sets for \(\Pi^0_1\) classes ⋮
Approximation methods in inductive inference ⋮
Splitting theorems and the jump operator ⋮
Feasible graphs with standard universe ⋮
Learning via queries and oracles ⋮
Some orbits for \({\mathcal E}\) ⋮
Learning classes of approximations to non-recursive functions. ⋮
The complexity of universal text-learners. ⋮
Learning to win process-control games watching game-masters ⋮
Degrees of Dowd-type generic oracles ⋮
Splitting theorems in recursion theory ⋮
Classes bounded by incomplete sets ⋮
Modelization of deterministic rational relations ⋮
Effectively closed sets and graphs of computable real functions. ⋮
Inductive inference with additional information. ⋮
The complexity of achievement and maintenance problems in agent-based systems ⋮
Unifying logic, topology and learning in parametric logic ⋮
Mathematics based on incremental learning -- excluded middle and inductive inference
This page was built for publication: Classical recursion theory. Vol. II
