Pages that link to "Item:Q1188502"

The following pages link to Classical recursion theory. The theory of functions and sets of natural numbers (Q1188502):

Displaying 50 items.

• Logicism as making arithmetic explicit (Q320159) (← links)
• Extended regular expressions: succinctness and decidability (Q372977) (← links)
• Traces, traceability, and lattices of traces under the set theoretic inclusion (Q377460) (← links)
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
• Badness and jump inversion in the enumeration degrees (Q412060) (← links)
• Closed choice and a uniform low basis theorem (Q424541) (← links)
• Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
• A uniquely ergodic cellular automaton (Q473194) (← links)
• Natural factors of the Medvedev lattice capturing IPC (Q481874) (← links)
• The strength of the Grätzer-Schmidt theorem (Q506962) (← links)
• Covering the recursive sets (Q508828) (← links)
• Random numbers as probabilities of machine behavior (Q524278) (← links)
• Universal recursively enumerable sets of strings (Q533863) (← links)
• On the classification of recursive languages (Q598240) (← links)
• Beta-shifts, their languages, and computability (Q633763) (← links)
• Bounded enumeration reducibility and its degree structure (Q661285) (← links)
• On relative randomness (Q688792) (← links)
• Computably enumerable sets and related issues (Q695800) (← links)
• Continuum, name and paradox (Q707899) (← links)
• Index sets and universal numberings (Q716308) (← links)
• Constructive dimension and Turing degrees (Q733739) (← links)
• Input-dependence in function-learning (Q733744) (← links)
• Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
• On the solution of trivalent decision problems by quantum state identification (Q734207) (← links)
• A class of reversible primitive recursive functions (Q737109) (← links)
• The Medvedev lattice of computably closed sets (Q818514) (← links)
• The Hausdorff-Ershov hierarchy in Euclidean spaces (Q818930) (← links)
• Strong enumeration reducibilities (Q850805) (← links)
• On the learnability of vector spaces (Q859986) (← links)
• Randomness and universal machines (Q864423) (← links)
• Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
• First-order logic in the Medvedev lattice (Q897478) (← links)
• An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
• When unlearning helps (Q924730) (← links)
• Degrees of difficulty of generalized r.e. separating classes (Q926177) (← links)
• Non-U-shaped vacillatory and team learning (Q927864) (← links)
• Learning in Friedberg numberings (Q939445) (← links)
• Intermediate logics and factors of the Medvedev lattice (Q952483) (← links)
• \(\Pi_1^0 \) classes, LR degrees and Turing degrees (Q958483) (← links)
• Numberings optimal for learning (Q972383) (← links)
• The diagonalization method in quantum recursion theory (Q972447) (← links)
• Iterative learning of simple external contextual languages (Q982646) (← links)
• Goodness in the enumeration and singleton degrees (Q992037) (← links)
• Introduction to Turing categories (Q998306) (← links)
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
• Degree spectra of the successor relation of computable linear orderings (Q1005920) (← links)
• Prescribed learning of r.e. classes (Q1017658) (← links)
• The structure of the s-degrees contained within a single e-degree (Q1024548) (← links)
• Minimum-weight cycle covers and their approximability (Q1028118) (← links)