NDLI: Plottable Real Number Functions and the Computable Graph Theorem

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Brattka, Vasco
Copyright Year	2008
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 from graphs to functions is problematic, and it turns out that the answers to the uniform and the nonuniform questions do not coincide. We prove that in both cases certain topological and computational properties (such as compactness or effective local connectedness) are sufficient for a positive answer, and we provide counterexamples which show that the corresponding properties are not superfluous. Additionally, we briefly discuss the special situation of the linear case.
Starting Page	303
Ending Page	328
Page Count	26
File Format	PDF
ISSN	00975397
DOI	10.1137/060658023
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	1
Volume Number	38
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2008-04-18
Access Restriction	Subscribed
Subject Keyword	computable real number functions recursive graphs Theory of numerations, effectively presented structures Constructive and recursive analysis
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Rice-Shapiro theorem in Computable Topology

Domatic partitions of computable graphs

Some results related to the continuity problem

Plottable real number functions and the computable graph theorem.

Computing Planarity in Computable Planar Graphs

Computable paradoxical decompositions

A generalization of Markov's approach to the continuity problem for Type 1 computable functions

Index Sets of Computable Structures

Intrinsic complexity of recursive functions on natural numbers with standard order

Plottable Real Number Functions and the Computable Graph Theorem

Similar Documents

The Rice-Shapiro theorem in Computable Topology

Domatic partitions of computable graphs

Some results related to the continuity problem

Plottable real number functions and the computable graph theorem.

Computing Planarity in Computable Planar Graphs

Computable paradoxical decompositions

A generalization of Markov's approach to the continuity problem for Type 1 computable functions

Index Sets of Computable Structures

Intrinsic complexity of recursive functions on natural numbers with standard order

Plottable Real Number Functions and the Computable Graph Theorem