Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.1/1007
Título: Analog computers and recursive functions over the reals
Autor: Graça, Daniel
Costa, José Felix
Data: 2003
Resumo: This paper revisits one of the rst models of analog computation, the General Purpose Analog Computer (GPAC). In particular, we restrict our attention to the improved model presented in [11] and we show that it can be further re ned. With this we prove the following: (i) the previous model can be simpli ed; (ii) it admits extensions having close connec- tions with the class of smooth continuous time dynamical systems. As a consequence, we conclude that some of these extensions achieve Turing universality. Finally, it is shown that if we introduce a new notion of computability for the GPAC, based on ideas from computable analysis, then one can compute transcendentally transcendental functions such as the Gamma function or Riemann's Zeta function.
Peer review: yes
URI: http://hdl.handle.net/10400.1/1007
Versão do Editor: http://dx.doi.org/10.1016/S0885-064X(03)00034-7
Aparece nas colecções:FCT2-Artigos (em revistas ou actas indexadas)

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
02-GC-MGPAC.pdf265,31 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.