Pages that link to "Item:Q1189450"
From MaRDI portal
The following pages link to Classical recursion theory. The theory of functions and sets of natural numbers. (Q1189450):
Displaying 41 items.
- Computation as an unbounded process (Q418791) (← links)
- Degrees bounding principles and universal instances in reverse mathematics (Q490869) (← links)
- Covering the recursive sets (Q508828) (← links)
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- On-demand minimum cost benchmarking for intermediate dataset storage in scientific cloud workflow systems (Q635318) (← links)
- On the logic of UNITY (Q673960) (← links)
- Irreducible, singular, and contiguous degrees (Q683370) (← links)
- Index sets and universal numberings (Q716308) (← links)
- On categoricity spectra for locally finite graphs (Q820480) (← links)
- Numberings optimal for learning (Q972383) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- The Rogers semilattices of generalized computable enumerations (Q1745093) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Well-orders realized by C.E. equivalence relations (Q2104248) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Polylog depth, highness and lowness for E (Q2304528) (← links)
- Random reals as measures of natural open sets (Q2346372) (← links)
- Invertible classes (Q2382282) (← links)
- Strong jump-traceability. I: The computably enumerable case (Q2474313) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
- Constructive logic and the Medvedev lattice (Q2505132) (← links)
- Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- Synchronizing Automata with Extremal Properties (Q2946348) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- The expressiveness of quasiperiodic and minimal shifts of finite type (Q4964767) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- Extending properly n - REA sets1 (Q5061390) (← links)
- THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS (Q5070472) (← links)
- Totally non‐immune sets (Q5179278) (← links)
- (Q6086231) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)
- Positivity-hardness results on Markov decision processes (Q6566469) (← links)
- On learning families of ideals in lattices and Boolean algebras (Q6636063) (← links)
- On learning down-sets in quasi-orders, and ideals in Boolean algebras (Q6661766) (← links)
