Analog Computers and the Iteration Functional

Publicação

dc.contributor.author	Campagnolo, Manuel Lameiras	por
dc.contributor.author	Moore, Cristopher	por
dc.contributor.author	Costa, José Félix	por
dc.date.accessioned	2009-02-10T13:11:58Z	por
dc.date.accessioned	2014-11-14T16:23:50Z
dc.date.available	2009-02-10T13:11:58Z	por
dc.date.available	2014-11-14T16:23:50Z
dc.date.issued	1998-12	por
dc.description.abstract	In this paper we extend the class of differentially algebraic functions computed by Shannon's General Purpose Analog Computer (GPAC). We relax Pour-El's definition of GPAC to obtain new operators and we use recursion theory on the reals to define a new class of analog computable functions. We show that a function F(t,x) which simulates t time-steps of a Turing machine on input x, and more generally a functional that allows us to define the t'th iterate of a definable function, are definable in this system. Therefore, functions like Gamma which are not generable by GPAC become computable in this extension	por
dc.identifier.uri	http://hdl.handle.net/10451/14111	por
dc.identifier.uri	http://repositorio.ul.pt/handle/10455/3009	por
dc.language.iso	por	por
dc.publisher	Department of Informatics, University of Lisbon	por
dc.relation.ispartofseries	di-fcul-tr-98-10	por
dc.subject	Analog computation	por
dc.subject	recursion theory	por
dc.subject	computable functions	por
dc.subject	universal computation	por
dc.title	Analog Computers and the Iteration Functional	por
dc.type	report
dspace.entity.type	Publication
rcaap.rights	openAccess	por
rcaap.type	report	por

Ficheiros

A mostrar 1 - 1 de 1