The following pages link to Handbook of computability theory (Q1307021):
Displaying 25 items.
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- Computability of analog networks (Q870263) (← links)
- Introduction to Turing categories (Q998306) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- The polynomial hierarchy of functions and its levels (Q2062128) (← links)
- Decidability and \(k\)-regular sequences (Q2077376) (← links)
- Modeling multitape Minsky and Turing machines by three-tape Minsky machines (Q2226960) (← links)
- Weighted G-Drazin inverses and a new pre-order on rectangular matrices (Q2422821) (← links)
- \(\Pi^0_1\)-presentations of algebras (Q2505502) (← links)
- A splitting theorem for $n-REA$ degrees (Q2750871) (← links)
- On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set (Q2778662) (← links)
- Computational classification of cellular automata (Q2869784) (← links)
- On Constructive Nilpotent Groups (Q2970967) (← links)
- Programming Experimental Procedures for Newtonian Kinematic Machines (Q3507418) (← links)
- Bounding minimal degrees by computably enumerable degrees (Q4254684) (← links)
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets (Q4897042) (← links)
- Hyperfinite type structures (Q4934036) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- An incomplete set of shortest descriptions (Q5388731) (← links)
- Finitely presented expansions of groups, semigroups, and algebras (Q5401728) (← links)
- Computability and Recursion (Q5689263) (← links)
- Lawvere-Tierney topologies for computability theorists (Q5875936) (← links)
- An effectively closed set with no join property* (Q6047711) (← links)
- Numberings, c.e. oracles, and fixed points (Q6062177) (← links)
