Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation

Identifieur interne : 000383 ( PascalFrancis/Corpus ); précédent : 000382; suivant : 000384

The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation

Auteurs : Olivier Bournez ; Manuel L. Campagnolo ; Daniel S. Graqa ; Emmanuel Hainry

Source :

RBID : Pascal:07-0531616

Descripteurs français

English descriptors

Abstract

In this paper we revisit one of the first models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

pA  
A01 01  1    @0 0302-9743
A05       @2 3959
A08 01  1  ENG  @1 The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation
A09 01  1  ENG  @1 Theory and applications of models of computation : Third international conference, TAMC 2006, Beijing, China, May 15-20, 2006 : proceedings
A11 01  1    @1 BOURNEZ (Olivier)
A11 02  1    @1 CAMPAGNOLO (Manuel L.)
A11 03  1    @1 GRAQA (Daniel S.)
A11 04  1    @1 HAINRY (Emmanuel)
A12 01  1    @1 CAI (Jin-yi) @9 ed.
A12 02  1    @1 COOPER (S. Barry) @9 ed.
A12 03  1    @1 LI (Angsheng) @9 ed.
A14 01      @1 INRIA Lorraine @3 FRA @Z 1 aut.
A14 02      @1 LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239 @2 54506 Vandoeuvre-Lès-Nancy @3 FRA @Z 1 aut. @Z 4 aut.
A14 03      @1 DM/ISA, Universidade Técnica de Lisboa @2 1349-017 Lisboa @3 PRT @Z 2 aut.
A14 04      @1 CLC, DM/IST, Universidade Técnica de Lisboa @2 1049-001 Lisboa @3 PRT @Z 2 aut. @Z 3 aut.
A14 05      @1 DM/FCT, Universidade do Algarve, C. Gambelas @2 8005-139 Faro @3 PRT @Z 3 aut.
A14 06      @1 Institut National Polytechnique de Lorraine @3 FRA @Z 4 aut.
A20       @1 631-643
A21       @1 2006
A23 01      @0 ENG
A26 01      @0 3-540-34021-1
A43 01      @1 INIST @2 16343 @5 354000153627760600
A44       @0 0000 @1 © 2007 INIST-CNRS. All rights reserved.
A45       @0 24 ref.
A47 01  1    @0 07-0531616
A60       @1 P @2 C
A61       @0 A
A64 01  1    @0 Lecture notes in computer science
A66 01      @0 DEU
C01 01    ENG  @0 In this paper we revisit one of the first models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.
C02 01  X    @0 001D02A05
C03 01  X  FRE  @0 Calculabilité @5 06
C03 01  X  ENG  @0 Computability @5 06
C03 01  X  SPA  @0 Calculabilidad @5 06
C03 02  X  FRE  @0 Calculateur analogique @5 18
C03 02  X  ENG  @0 Analog computer @5 18
C03 02  X  SPA  @0 Computadora analógica @5 18
C03 03  X  FRE  @0 Modèle analogique @5 23
C03 03  X  ENG  @0 Analog model @5 23
C03 03  X  SPA  @0 Modelo analógico @5 23
C03 04  X  FRE  @0 Fonction réelle @5 24
C03 04  X  ENG  @0 Real function @5 24
C03 04  X  SPA  @0 Función real @5 24
C03 05  X  FRE  @0 Equation polynomiale @5 25
C03 05  X  ENG  @0 Polynomial equation @5 25
C03 05  X  SPA  @0 Ecuación polinomial @5 25
C03 06  X  FRE  @0 Equation différentielle @5 26
C03 06  X  ENG  @0 Differential equation @5 26
C03 06  X  SPA  @0 Ecuación diferencial @5 26
C03 07  X  FRE  @0 Modélisation @5 27
C03 07  X  ENG  @0 Modeling @5 27
C03 07  X  SPA  @0 Modelización @5 27
N21       @1 344
N44 01      @1 OTO
N82       @1 OTO
pR  
A30 01  1  ENG  @1 TAMC 2006 @2 3 @3 Beijing CHN @4 2006

Format Inist (serveur)

NO : PASCAL 07-0531616 INIST
ET : The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation
AU : BOURNEZ (Olivier); CAMPAGNOLO (Manuel L.); GRAQA (Daniel S.); HAINRY (Emmanuel); CAI (Jin-yi); COOPER (S. Barry); LI (Angsheng)
AF : INRIA Lorraine/France (1 aut.); LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239/54506 Vandoeuvre-Lès-Nancy/France (1 aut., 4 aut.); DM/ISA, Universidade Técnica de Lisboa/1349-017 Lisboa/Portugal (2 aut.); CLC, DM/IST, Universidade Técnica de Lisboa/1049-001 Lisboa/Portugal (2 aut., 3 aut.); DM/FCT, Universidade do Algarve, C. Gambelas/8005-139 Faro/Portugal (3 aut.); Institut National Polytechnique de Lorraine/France (4 aut.)
DT : Publication en série; Congrès; Niveau analytique
SO : Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 3959; Pp. 631-643; Bibl. 24 ref.
LA : Anglais
EA : In this paper we revisit one of the first models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.
CC : 001D02A05
FD : Calculabilité; Calculateur analogique; Modèle analogique; Fonction réelle; Equation polynomiale; Equation différentielle; Modélisation
ED : Computability; Analog computer; Analog model; Real function; Polynomial equation; Differential equation; Modeling
SD : Calculabilidad; Computadora analógica; Modelo analógico; Función real; Ecuación polinomial; Ecuación diferencial; Modelización
LO : INIST-16343.354000153627760600
ID : 07-0531616

Links to Exploration step

Pascal:07-0531616

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation</title>
<author>
<name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name>
<affiliation>
<inist:fA14 i1="01">
<s1>INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="02">
<s1>LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Campagnolo, Manuel L" sort="Campagnolo, Manuel L" uniqKey="Campagnolo M" first="Manuel L." last="Campagnolo">Manuel L. Campagnolo</name>
<affiliation>
<inist:fA14 i1="03">
<s1>DM/ISA, Universidade Técnica de Lisboa</s1>
<s2>1349-017 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="04">
<s1>CLC, DM/IST, Universidade Técnica de Lisboa</s1>
<s2>1049-001 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Graqa, Daniel S" sort="Graqa, Daniel S" uniqKey="Graqa D" first="Daniel S." last="Graqa">Daniel S. Graqa</name>
<affiliation>
<inist:fA14 i1="04">
<s1>CLC, DM/IST, Universidade Técnica de Lisboa</s1>
<s2>1049-001 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="05">
<s1>DM/FCT, Universidade do Algarve, C. Gambelas</s1>
<s2>8005-139 Faro</s2>
<s3>PRT</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name>
<affiliation>
<inist:fA14 i1="02">
<s1>LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="06">
<s1>Institut National Polytechnique de Lorraine</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">07-0531616</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 07-0531616 INIST</idno>
<idno type="RBID">Pascal:07-0531616</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000383</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation</title>
<author>
<name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name>
<affiliation>
<inist:fA14 i1="01">
<s1>INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="02">
<s1>LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Campagnolo, Manuel L" sort="Campagnolo, Manuel L" uniqKey="Campagnolo M" first="Manuel L." last="Campagnolo">Manuel L. Campagnolo</name>
<affiliation>
<inist:fA14 i1="03">
<s1>DM/ISA, Universidade Técnica de Lisboa</s1>
<s2>1349-017 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="04">
<s1>CLC, DM/IST, Universidade Técnica de Lisboa</s1>
<s2>1049-001 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Graqa, Daniel S" sort="Graqa, Daniel S" uniqKey="Graqa D" first="Daniel S." last="Graqa">Daniel S. Graqa</name>
<affiliation>
<inist:fA14 i1="04">
<s1>CLC, DM/IST, Universidade Técnica de Lisboa</s1>
<s2>1049-001 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="05">
<s1>DM/FCT, Universidade do Algarve, C. Gambelas</s1>
<s2>8005-139 Faro</s2>
<s3>PRT</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name>
<affiliation>
<inist:fA14 i1="02">
<s1>LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="06">
<s1>Institut National Polytechnique de Lorraine</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint>
<date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Analog computer</term>
<term>Analog model</term>
<term>Computability</term>
<term>Differential equation</term>
<term>Modeling</term>
<term>Polynomial equation</term>
<term>Real function</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Calculabilité</term>
<term>Calculateur analogique</term>
<term>Modèle analogique</term>
<term>Fonction réelle</term>
<term>Equation polynomiale</term>
<term>Equation différentielle</term>
<term>Modélisation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">In this paper we revisit one of the first models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0302-9743</s0>
</fA01>
<fA05>
<s2>3959</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG">
<s1>The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>Theory and applications of models of computation : Third international conference, TAMC 2006, Beijing, China, May 15-20, 2006 : proceedings</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>BOURNEZ (Olivier)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>CAMPAGNOLO (Manuel L.)</s1>
</fA11>
<fA11 i1="03" i2="1">
<s1>GRAQA (Daniel S.)</s1>
</fA11>
<fA11 i1="04" i2="1">
<s1>HAINRY (Emmanuel)</s1>
</fA11>
<fA12 i1="01" i2="1">
<s1>CAI (Jin-yi)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1">
<s1>COOPER (S. Barry)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1">
<s1>LI (Angsheng)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01">
<s1>INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="03">
<s1>DM/ISA, Universidade Técnica de Lisboa</s1>
<s2>1349-017 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="04">
<s1>CLC, DM/IST, Universidade Técnica de Lisboa</s1>
<s2>1049-001 Lisboa</s2>
<s3>PRT</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="05">
<s1>DM/FCT, Universidade do Algarve, C. Gambelas</s1>
<s2>8005-139 Faro</s2>
<s3>PRT</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="06">
<s1>Institut National Polytechnique de Lorraine</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20>
<s1>631-643</s1>
</fA20>
<fA21>
<s1>2006</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA26 i1="01">
<s0>3-540-34021-1</s0>
</fA26>
<fA43 i1="01">
<s1>INIST</s1>
<s2>16343</s2>
<s5>354000153627760600</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>24 ref.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>07-0531616</s0>
</fA47>
<fA60>
<s1>P</s1>
<s2>C</s2>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01">
<s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>In this paper we revisit one of the first models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE">
<s0>Calculabilité</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG">
<s0>Computability</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA">
<s0>Calculabilidad</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE">
<s0>Calculateur analogique</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Analog computer</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>Computadora analógica</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Modèle analogique</s0>
<s5>23</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Analog model</s0>
<s5>23</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Modelo analógico</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Fonction réelle</s0>
<s5>24</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Real function</s0>
<s5>24</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Función real</s0>
<s5>24</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE">
<s0>Equation polynomiale</s0>
<s5>25</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG">
<s0>Polynomial equation</s0>
<s5>25</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA">
<s0>Ecuación polinomial</s0>
<s5>25</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE">
<s0>Equation différentielle</s0>
<s5>26</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG">
<s0>Differential equation</s0>
<s5>26</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA">
<s0>Ecuación diferencial</s0>
<s5>26</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE">
<s0>Modélisation</s0>
<s5>27</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG">
<s0>Modeling</s0>
<s5>27</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA">
<s0>Modelización</s0>
<s5>27</s5>
</fC03>
<fN21>
<s1>344</s1>
</fN21>
<fN44 i1="01">
<s1>OTO</s1>
</fN44>
<fN82>
<s1>OTO</s1>
</fN82>
</pA>
<pR>
<fA30 i1="01" i2="1" l="ENG">
<s1>TAMC 2006</s1>
<s2>3</s2>
<s3>Beijing CHN</s3>
<s4>2006</s4>
</fA30>
</pR>
</standard>
<server>
<NO>PASCAL 07-0531616 INIST</NO>
<ET>The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation</ET>
<AU>BOURNEZ (Olivier); CAMPAGNOLO (Manuel L.); GRAQA (Daniel S.); HAINRY (Emmanuel); CAI (Jin-yi); COOPER (S. Barry); LI (Angsheng)</AU>
<AF>INRIA Lorraine/France (1 aut.); LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239/54506 Vandoeuvre-Lès-Nancy/France (1 aut., 4 aut.); DM/ISA, Universidade Técnica de Lisboa/1349-017 Lisboa/Portugal (2 aut.); CLC, DM/IST, Universidade Técnica de Lisboa/1049-001 Lisboa/Portugal (2 aut., 3 aut.); DM/FCT, Universidade do Algarve, C. Gambelas/8005-139 Faro/Portugal (3 aut.); Institut National Polytechnique de Lorraine/France (4 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 3959; Pp. 631-643; Bibl. 24 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper we revisit one of the first models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.</EA>
<CC>001D02A05</CC>
<FD>Calculabilité; Calculateur analogique; Modèle analogique; Fonction réelle; Equation polynomiale; Equation différentielle; Modélisation</FD>
<ED>Computability; Analog computer; Analog model; Real function; Polynomial equation; Differential equation; Modeling</ED>
<SD>Calculabilidad; Computadora analógica; Modelo analógico; Función real; Ecuación polinomial; Ecuación diferencial; Modelización</SD>
<LO>INIST-16343.354000153627760600</LO>
<ID>07-0531616</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000383 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000383 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:07-0531616
   |texte=   The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022