1. DSpace-CRIS UAEMEX
  2. Interoperabilidad Repositorio Nacional
  3. Producción
Please use this identifier to cite or link to this item: http://ri.uaemex.mx/handle20.500.11799/39947
DC FieldValueLanguage
dc.creatorJOSE RAYMUNDO MARCIAL ROMERO-
dc.creatorJosé Antonio Hernández Servín-
dc.date2010-
dc.identifierhttp://hdl.handle.net/20.500.11799/39947-
dc.descriptionThe 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.-
dc.formatapplication/application/pdf-
dc.languageeng-
dc.publisherAsociación Española para la Inteligencia Artificial-
dc.relationhttp://www.redalyc.org/revista.oa?id=925-
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0-
dc.sourceInteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.48 Vol.14-
dc.subjectIngeniería-
dc.subjectExact real-number computation-
dc.subjectSequential Computation-
dc.subjectPCF-
dc.subjectSemantics of programming lan- guages-
dc.subjectinfo:eu-repo/classification/cti/7-
dc.titleFunctional first order definability of LRTp-
dc.typearticle-
dc.audiencestudents-
dc.audienceresearchers-
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:Producción
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.