Polynomial-time hierarchy of computable reals

Loading...
Thumbnail Image
File version
Author(s)
Chen, Q
Su, K
Wu, L
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2011
Size

459649 bytes

File type(s)

application/pdf

Location
License
Abstract

In 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.

Journal Title

Journal of Computational Information Systems

Conference Title
Book Title
Edition
Volume

7

Issue

4

Thesis Type
Degree Program
School
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 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.

Item Access Status
Note
Access the data
Related item(s)
Subject

Numerical and computational mathematics not elsewhere classified

Information and computing sciences

Persistent link to this record
Citation
Collections