Models of computability of partial functions on the reals

Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/21266

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Zucker, Jeffery	-
dc.contributor.author	Fu, Ming	-
dc.date.accessioned	2017-03-30T15:23:13Z	-
dc.date.available	2017-03-30T15:23:13Z	-
dc.date.issued	2007-10	-
dc.identifier.uri	http://hdl.handle.net/11375/21266	-
dc.description.abstract	<p> Various models of computability of partial functions f on the real numbers are studied: two abstract, based on approximable computation w.r.t high level programming languages; two concrete, based on computable tracking functions on the rationals; and two based on polynomial approximation. It is shown that these six models are equivalent, under the assumptions: (1) the domain of f is a union of an effective sequence of rational open intervals, and (2) f is effectively locally uniformly continuous. This includes the well-known functions of elementary real analysis (rational, exponential, trigonometric, etc., and their inverses) and generalises a previously know equivalence result for total functions on the reals. </p>	en_US
dc.language.iso	en	en_US
dc.subject	computability	en_US
dc.subject	model	en_US
dc.subject	partial functions	en_US
dc.subject	reals	en_US
dc.title	Models of computability of partial functions on the reals	en_US
dc.contributor.department	Computing and Software	en_US
dc.description.degreetype	Thesis	en_US
dc.description.degree	Master of Science (MSc)	en_US
Appears in Collections:	Digitized Open Access Dissertations and Theses

Files in This Item:

File	Description	Size	Format
Fu_Ming_Q_2007Oct_Masters.pdf Open Access		1.53 MB	Adobe PDF	View/Open