The following pages link to Computability (Q2799745):
Displayed 31 items.
- Effective operations of type 2 in PCAs (Q5740205) (← links)
- On Martin’s pointed tree theorem (Q5740206) (← links)
- On the topological aspects of the theory of represented spaces (Q5740207) (← links)
- Randomness and degree theory for infinite time register machines1 (Q5740208) (← links)
- Maximality and collapse in the hierarchy of α-c.a. degrees (Q5859843) (← links)
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs (Q5859844) (← links)
- Degrees of sets having no subsets of higher m- and t t-degree (Q5859845) (← links)
- Computing on the Banach space C [ 0 , 1 ] (Q5859846) (← links)
- Randomness extraction in computability theory (Q5880936) (← links)
- Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)
- Evitable iterates of the consistency operator (Q5880939) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
- Confluence in Data Reduction: Bridging Graph Transformation and Kernelization (Q5891215) (← links)
- Limit computability and ultrafilters (Q6048000) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- L 2 -Betti numbers and computability of reals (Q6048004) (← links)
- Banach’s theorem in higher-order reverse mathematics (Q6062174) (← links)
- Strong computable type (Q6062176) (← links)
- Numberings, c.e. oracles, and fixed points (Q6062177) (← links)
- Approximating Kolmogorov complexity (Q6062178) (← links)
- Lowness properties for strong reducibilities and the computational power of maximal sets (Q6128323) (← links)
- Nearly computable real numbers (Q6128325) (← links)
- Enumerations of families closed under finite differences (Q6128326) (← links)
- Preface (Q6146818) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- Inversion operations in algebraic structures (Q6146820) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- Effectively infinite classes of numberings and computable families of reals (Q6146823) (← links)
- Notes on overt choice (Q6146824) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)