Recursive Analysis Characterized as a Class of Real Recursive Functions
Identifieur interne : 000086 ( Crin/Checkpoint ); précédent : 000085; suivant : 000087Recursive Analysis Characterized as a Class of Real Recursive Functions
Auteurs : Olivier Bournez ; Emmanuel HainrySource :
- Fundamenta Informaticae ; 2005.
Abstract
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis. In a di erent and orthogonal work, we proposed a minimization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixing the two approaches we prove that computable functions over the real numbers in the sense of recursive analysis can be characterized as the smallest class of functions that contains some basic functions, and closed by composition, linear integration, minimization and limit schema.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:bournez05gLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" wicri:score="-14">Recursive Analysis Characterized as a Class of Real Recursive Functions</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bournez05g</idno><date when="2005" year="2005">2005</date><idno type="wicri:Area/Crin/Corpus">004278</idno><idno type="wicri:Area/Crin/Curation">004278</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004278</idno><idno type="wicri:Area/Crin/Checkpoint">000086</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000086</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Recursive Analysis Characterized as a Class of Real Recursive Functions</title><author><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name></author><author><name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name></author></analytic><series><title level="j">Fundamenta Informaticae</title><imprint><date when="2005" type="published">2005</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2781">Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis. In a di erent and orthogonal work, we proposed a minimization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixing the two approaches we prove that computable functions over the real numbers in the sense of recursive analysis can be characterized as the smallest class of functions that contains some basic functions, and closed by composition, linear integration, minimization and limit schema.</div></front></TEI><BibTex type="article"><ref>bournez05g</ref><crinnumber>A05-R-267</crinnumber><category>1</category><equipe>PROTHEO</equipe><author><e>Bournez, Olivier</e><e>Hainry, Emmanuel</e></author><title>Recursive Analysis Characterized as a Class of Real Recursive Functions</title><journal>Fundamenta Informaticae</journal><year>2005</year><month>Oct</month><abstract>Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis. In a di erent and orthogonal work, we proposed a minimization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixing the two approaches we prove that computable functions over the real numbers in the sense of recursive analysis can be characterized as the smallest class of functions that contains some basic functions, and closed by composition, linear integration, minimization and limit schema.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000086 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 000086 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Checkpoint
|type= RBID
|clé= CRIN:bournez05g
|texte= Recursive Analysis Characterized as a Class of Real Recursive Functions
}}
| This area was generated with Dilib version V0.6.33. |  |