Calculus of Cost Functions

Nies, A

dc.contributor.author	Nies, A	en
dc.date.accessioned	2014-01-05T22:48:16Z	en
dc.date.available	2014-01-05T22:48:16Z	en
dc.date.issued	2013	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-445 (2013)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/21344	en
dc.description.abstract	Cost functions were introduced as a framework for constructions of c.e. incomputable sets that are close to computable. We carry out a systematic study of cost functions. We relate their algebraic properties to their expressive strength. We show that additive cost functions correspond to the K-trivial sets. We prove a cost function basis theorem, and give a general construction for building c.e. sets that are close to being Turing complete.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	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	Calculus of Cost Functions	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