scientific article; zbMATH DE number 3315195
From MaRDI portal
Publication:5596230
zbMath0198.02501MaRDI QIDQ5596230
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Recursive categoricity and recursive stability ⋮ Algebraic specifications of computable and semicomputable data types ⋮ Non-collapse of the effective Wadge hierarchy ⋮ Unnamed Item ⋮ Математические основы теории познания на основе экспериментов ⋮ Universality in Molecular and Cellular Computing ⋮ Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III ⋮ Generic Kleene fixed point theorem ⋮ THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES ⋮ Small Universal Devices ⋮ Prefix monoids of groups and right units of special inverse monoids ⋮ Computable torsion-free nilpotent groups of finite dimension. ⋮ Positive numberings in admissible sets ⋮ How much partiality is needed for a theory of computability? ⋮ On fairly low and superlow sets ⋮ Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs ⋮ Some independence results for control structures in complete numberings ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Finite algebras with non-computable morphisms ⋮ Kleene index sets and functional m-degrees ⋮ On computable automorphisms of the rational numbers ⋮ Computation by assembly ⋮ Computable one-to-one enumerations of effective domains ⋮ Precomplete numberings ⋮ Max Dehn ⋮ Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I ⋮ Admissible representations of effective cpo's ⋮ Asymptotic invariants, complexity of groups and related problems ⋮ \(\forall \exists^{5}\)-equational theory of context unification is undecidable
