Non recursive functions have transcendental generating functions
Proves that nonprimitive recursive functions have transcendental generating series. This result translates a certain measure of the complexity of a function, the fact of not being primitive recursive, into another measure of the complexity of the generating series associated to the function, the fac...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 1989 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/104671 |
| Acesso em linha: | https://hdl.handle.net/2117/104671 |
| Access Level: | acceso abierto |
| Palavra-chave: | Complexity, Computational Function complexity measures Nonrecursive functions Transcendental generating series Nonprimitive recursive functions Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
| Resumo: | Proves that nonprimitive recursive functions have transcendental generating series. This result translates a certain measure of the complexity of a function, the fact of not being primitive recursive, into another measure of the complexity of the generating series associated to the function, the fact of being transcendental. |
|---|