Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artículo científico |
| Lenguaje: | en |
| Publicado: |
Asociación Española para la Inteligencia Artificial
2010
|
| Materias: | |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=92513175004 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- Functional first order definability of LRTp J. Raymundo Marcial-Romero J. A. Hernández Ingeniería PCF guages Exact real number computation Sequential Computation The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable rst order relations in the sense of Brattka are denable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are denable in the language. This paper is an expanded version of [12] in which we show that the non-deterministic version of the limit operator, which allows to dene all computable rst order relations, when restricted to single-valued total inputs, produces single-valued total outputs. This implies that not only the polynomials are denable in the language but also allcomputable rst order functions. 2010 artículo científico 1137-3601 https://www.redalyc.org/articulo.oa?id=92513175004 en http://www.redalyc.org/revista.oa?id=925 Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial application/pdf Asociación Española para la Inteligencia Artificial Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.48 Vol.14