Carregant...
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.
Guardat en:
| Publicat a: | Beyond the Horizon of Computability |
|---|---|
| Autor principal: | |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7309512/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51466-2_11 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|