Characterizing Polynomial Time Computability of Rational and Real Functions
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the computational complexity of real functions defined over compact domains...
Saved in:
| Published in: | Electronic proceedings in theoretical computer science Vol. 9; no. Proc. DCM 2009; pp. 54 - 64 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Open Publishing Association
15.11.2009
|
| ISSN: | 2075-2180, 2075-2180 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!