Year: 1990
Type: conference-paper
Abstract: The concept of a non-computable function has been valuable in showing absolute limits to our power to compute.But it is problematically oxymoronic, particular in computer science classes, since functions are generally understood algorithmically, as objects which can be computed.This paper presents an alternative explanation for functions usually regarded as non-computable, based on a more careful examination of the data types of domain and range.The limits of computation are still revealed, and additional algorithmic consequences are found.But the confusion inherent in the self-contradictory phrase "non-computable function" is avoided.
Author: Newcomb Greenleaf
Institution: Columbia University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4253984356
