Please use this identifier to cite or link to this item:
http://ri.uaemex.mx/handle20.500.11799/39947| Title: | Functional first order definability of LRTp | Keywords: | Ingeniería;Exact real-number computation;Sequential Computation;PCF;Semantics of programming lan- guages;info:eu-repo/classification/cti/7 | Publisher: | Asociación Española para la Inteligencia Artificial | Project: | http://www.redalyc.org/revista.oa?id=925 | Description: | 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. | Other Identifiers: | http://hdl.handle.net/20.500.11799/39947 | Rights: | info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0 |
| Appears in Collections: | Producción |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.