Calculus of Cost Functions

Show simple item record Nies, A en 2014-01-05T22:48:16Z en 2014-01-05T22:48:16Z en 2013 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-445 (2013) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri 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 en
dc.source.uri 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 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace