Show simple item record

dc.contributor.authorChen, Qingliangen_US
dc.contributor.authorSu, Kaileen_US
dc.contributor.authorWu, Lijunen_US
dc.date.accessioned2017-04-24T09:26:12Z
dc.date.available2017-04-24T09:26:12Z
dc.date.issued2011en_US
dc.date.modified2013-06-26T02:55:58Z
dc.identifier.issn15539105en_US
dc.identifier.urihttp://hdl.handle.net/10072/44872
dc.description.abstractIn mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent459649 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherBinary Information Pressen_US
dc.publisher.placeUnited Statesen_US
dc.publisher.urihttp://www.jofcis.com/publishedpapers/2011_7_4_1108_1115.pdfen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofpagefrom1108en_US
dc.relation.ispartofpageto1115en_US
dc.relation.ispartofissue4en_US
dc.relation.ispartofjournalJournal of Computational Information Systemsen_US
dc.relation.ispartofvolume7en_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchNumerical and Computational Mathematics not elsewhere classifieden_US
dc.subject.fieldofresearchcode010399en_US
dc.titlePolynomial-time hierarchy of computable realsen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.rights.copyrightCopyright 2011 Binary Information Press. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.en_US
gro.date.issued2011
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record