Cargando…
On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings
The present paper surveys some results from the inductive inference of recursive functions, which are related to the characterization of inferrible function classes in terms of complexity theory, and in terms of recursive numberings. Some new results and open problems are also included.
Autor principal: | Zeugmann, Thomas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7309512/ http://dx.doi.org/10.1007/978-3-030-51466-2_11 |
Ejemplares similares
-
Recursion Theory and Computational Complexity
por: Lolli, G
Publicado: (2011) -
Recursion theory
por: Shoenfield, Joseph R
Publicado: (2017) -
Classical recursion theory: the theory of functions and sets of natural numbers
por: Odifreddi, Piergiorgio
Publicado: (1992) -
Recursive number theory: a development of recursive arithmetic in a logic-free equation calculus
por: Goodstein, Reuben Louis
Publicado: (1957) -
Classical recursion theory
por: Odifreddi, Piergiorgio, 1950-
Publicado: (1989)