Plottable Real Number Functions and the Computable Graph Theorem
| dc.contributor.author | Brattka, Vasco | |
| dc.date.accessioned | 2021-10-08T07:16:03Z | |
| dc.date.available | 2021-10-08T07:16:03Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable if and only if its graph is recursive. It is known that this result can be generalized to real number functions where it has an important practical interpretation: the total computable real number functions are precisely those which can be effectively plotted with any given resolution. We generalize the Graph Theorem to appropriate partial real number functions and even further to functions defined on certain computable metric spaces. Besides the nonuniform version of the Graph Theorem which logically relates computability properties of the function and computability properties of its graph, we also discuss the uniform version: given a program of a function, can we algorithmically derive a description of its graph? And, vice versa, given a description of the graph, can we derive a program of the function? While the passage from functions to graphs is always computable, the inverse direction fr... | |
| dc.identifier.apacitation | Brattka, V. (2008). Plottable Real Number Functions and the Computable Graph Theorem. <i>SIAM Journal on Computing</i>, 38(1), 303 - 328. http://hdl.handle.net/11427/34759 | en_ZA |
| dc.identifier.chicagocitation | Brattka, Vasco "Plottable Real Number Functions and the Computable Graph Theorem." <i>SIAM Journal on Computing</i> 38, 1. (2008): 303 - 328. http://hdl.handle.net/11427/34759 | en_ZA |
| dc.identifier.citation | Brattka, V. 2008. Plottable Real Number Functions and the Computable Graph Theorem. <i>SIAM Journal on Computing.</i> 38(1):303 - 328. http://hdl.handle.net/11427/34759 | en_ZA |
| dc.identifier.issn | 0097-5397 | |
| dc.identifier.issn | 1095-7111 | |
| dc.identifier.ris | TY - Journal Article AU - Brattka, Vasco AB - The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable if and only if its graph is recursive. It is known that this result can be generalized to real number functions where it has an important practical interpretation: the total computable real number functions are precisely those which can be effectively plotted with any given resolution. We generalize the Graph Theorem to appropriate partial real number functions and even further to functions defined on certain computable metric spaces. Besides the nonuniform version of the Graph Theorem which logically relates computability properties of the function and computability properties of its graph, we also discuss the uniform version: given a program of a function, can we algorithmically derive a description of its graph? And, vice versa, given a description of the graph, can we derive a program of the function? While the passage from functions to graphs is always computable, the inverse direction fr... DA - 2008 DB - OpenUCT DP - University of Cape Town IS - 1 J1 - SIAM Journal on Computing LK - https://open.uct.ac.za PY - 2008 SM - 0097-5397 SM - 1095-7111 T1 - Plottable Real Number Functions and the Computable Graph Theorem TI - Plottable Real Number Functions and the Computable Graph Theorem UR - http://hdl.handle.net/11427/34759 ER - | en_ZA |
| dc.identifier.uri | http://hdl.handle.net/11427/34759 | |
| dc.identifier.vancouvercitation | Brattka V. Plottable Real Number Functions and the Computable Graph Theorem. SIAM Journal on Computing. 2008;38(1):303 - 328. http://hdl.handle.net/11427/34759. | en_ZA |
| dc.language.iso | eng | |
| dc.publisher.department | Department of Mathematics and Applied Mathematics | |
| dc.publisher.faculty | Faculty of Science | |
| dc.source | SIAM Journal on Computing | |
| dc.source.journalissue | 1 | |
| dc.source.journalvolume | 38 | |
| dc.source.pagination | 303 - 328 | |
| dc.source.uri | https://dx.doi.org/10.1137/060658023 | |
| dc.subject.other | Computable real number functions | |
| dc.subject.other | recursive graphs | |
| dc.title | Plottable Real Number Functions and the Computable Graph Theorem | |
| dc.type | Journal Article | |
| uct.type.publication | Research | |
| uct.type.resource | Journal Article |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- BrattkaVasco_Plottable_Real_2008.pdf
- Size:
- 233.25 KB
- Format:
- Adobe Portable Document Format
- Description: