Fundamentals of generalized recursion theory
From MaRDI portal
Recommendations
- General recursion theory. An axiomatic approach
- GENERALIZATIONS OF THE RECURSION THEOREM
- scientific article; zbMATH DE number 3857082
- scientific article; zbMATH DE number 480999
- Recursion theory
- scientific article; zbMATH DE number 478433
- scientific article; zbMATH DE number 1176133
- Higher recursion theory
- scientific article; zbMATH DE number 194101
Cited in
(10)- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- Introduction to Turing categories
- Extending the first-order theory of combinators with self-referential truth
- Defining recursive predicates in graph orders
- Definability of recursive predicates in the induced subgraph order
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory
- scientific article; zbMATH DE number 3914307 (Why is no real title available?)
- Computation by `While' programs on topological partial algebras
- scientific article; zbMATH DE number 1390021 (Why is no real title available?)
This page was built for publication: Fundamentals of generalized recursion theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078561)