Pages that link to "Item:Q1307029"
From MaRDI portal
The following pages link to Classical recursion theory. Vol. II (Q1307029):
Displaying 50 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Natural factors of the Muchnik lattice capturing IPC (Q385809) (← links)
- Streamlined subrecursive degree theory (Q408165) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- Derandomization in game-theoretic probability (Q468727) (← links)
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective (Q494067) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- Undefinability of truth and nonstandard models (Q598273) (← links)
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- The effective theory of Borel equivalence relations (Q636325) (← links)
- Games with 1-backtracking (Q636360) (← links)
- Analogues of quantum complementarity in the theory of automata (Q639815) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability (Q655314) (← links)
- Equational theories for inductive types (Q678762) (← links)
- Irreducible, singular, and contiguous degrees (Q683370) (← links)
- Epistemic entrenchment and arithmetical hierarchy (Q685538) (← links)
- Non-determinism in Gödel's system \(T\) (Q693050) (← links)
- Real recursive functions and their hierarchy (Q706790) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Determining and stationary sets for some classes of partial recursive functions (Q757357) (← links)
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees (Q764275) (← links)
- The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- Unifying logic, topology and learning in parametric logic (Q817837) (← links)
- Mathematics based on incremental learning -- excluded middle and inductive inference (Q817838) (← links)
- The Medvedev lattice of computably closed sets (Q818514) (← links)
- The jump operation for structure degrees (Q818923) (← links)
- Strong enumeration reducibilities (Q850805) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees (Q958483) (← links)
- Decision problems for Turing machines (Q990079) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density (Q1092896) (← links)
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees (Q1094415) (← links)
- An improved zero-one law for algorithmically random sequences (Q1127324) (← links)
- Myhill's work in recursion theory (Q1192344) (← links)
