Toward a generalized computability theory

DOI10.1007/BF02261744zbMath0829.03023MaRDI QIDQ1346903

I. V. Ashaev, V. Ya. Belyaev, Alexei G. Myasnikov

Publication date: 20 April 1995

Published in: Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

algorithmrecursive functionsalgebraic systemsBSS-machineslist extension

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Related Items (1)

Properties of \(s\Sigma\)-reducibility

Cites Work

• Unnamed Item
• Unnamed Item
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Toward a generalized computability theory