Computable $p$-adic Numbers

Kapoulas, G

dc.contributor.author	Kapoulas, G	en
dc.date.accessioned	2009-04-16T23:09:59Z	en
dc.date.available	2009-04-16T23:09:59Z	en
dc.date.issued	1999-11	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-115 (1999)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3624	en
dc.description.abstract	In the present work the notion of the computable (primitive recursive, polynomially time computable) p-adic number is introduced and studied. Basic properties of these numbers and the set of indices representing them are established and it is proved that the above defined fields are p-adically closed. Using the notion of a notation system introduced by Y. Moschovakis an abstract characterization of the indices representing the field of computable p-adic numbers is established.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Computable $p$-adic Numbers	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en