Abstract
We consider an approach to computability in admissible sets based on a general notion of computable process, with Σ-predicates and Σ-operators as special cases, inspired by ideas from the Ershov-Scott theory of approximation spaces. We present some results from different topics in generalized computability, including reducibilities on admissible sets and structures, general notion of a jump, and computable analysis (more exactly, computability over the reals), obtained with the help of this approach, and state some open questions. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Stukachev, A. (2013). On processes and structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7921 LNCS, pp. 393–402). https://doi.org/10.1007/978-3-642-39053-1_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
