scientific article; zbMATH DE number 3315195

Cited in

(37)

Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
Admissible representations of effective cpo's
Recursive categoricity and recursive stability
Algebraic specifications of computable and semicomputable data types
Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
Computation by assembly
Max Dehn
\(\forall \exists^{5}\)-equational theory of context unification is undecidable
Finite algebras with non-computable morphisms
A class of recursive permutations which is primitive recursive complete
Precomplete numberings
Positive numberings in admissible sets
On fairly low and superlow sets
Generic Kleene fixed point theorem
Some independence results for control structures in complete numberings
On computable automorphisms of the rational numbers
Small universal devices
Asymptotic invariants, complexity of groups and related problems.
Universality in Molecular and Cellular Computing
Kleene index sets and functional m-degrees
Computable torsion-free nilpotent groups of finite dimension.
scientific article; zbMATH DE number 3564314 (Why is no real title available?)
Математические основы теории познания на основе экспериментов
Non-collapse of the effective Wadge hierarchy
The recognition complexity of decidable theories
Computable one-to-one enumerations of effective domains
Prefix monoids of groups and right units of special inverse monoids
How much partiality is needed for a theory of computability?
Learning from the masters (and some of their pupils)
On the formalization of the notion of a concurrent algorithm
Formalizing the notions of non-interactive and interactive algorithms
A family whose computable numberings are all complete
Control structures in computable numberings and the completion operator
On e-principal and e-complete numberings
On the number of minimal elements of ideals of Rogers semilattices
Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5596230)