The following pages link to (Q5596230):
Displaying 31 items.
- Computable torsion-free nilpotent groups of finite dimension. (Q404717) (← links)
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I (Q1065930) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III (Q1118677) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Computation by assembly (Q1225457) (← links)
- Max Dehn (Q1254237) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- Finite algebras with non-computable morphisms (Q1750753) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- Precomplete numberings (Q2036469) (← links)
- Positive numberings in admissible sets (Q2191379) (← links)
- On fairly low and superlow sets (Q2211381) (← links)
- Generic Kleene fixed point theorem (Q2403650) (← links)
- Some independence results for control structures in complete numberings (Q2732286) (← links)
- On computable automorphisms of the rational numbers (Q2758070) (← links)
- Small Universal Devices (Q2944894) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- Kleene index sets and functional <i>m</i>-degrees (Q3323936) (← links)
- (Q4136543) (← links)
- Математические основы теории познания на основе экспериментов (Q4553565) (← links)
- Non-collapse of the effective Wadge hierarchy (Q5061393) (← links)
- THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES (Q5086506) (← links)
- Prefix monoids of groups and right units of special inverse monoids (Q6065478) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)
- Learning from the masters (and some of their pupils) (Q6623911) (← links)
