Abstract
Classically, computability is introduced explicitly for functions f :⊆ (Σ*)n → Σ* on the set Σ* of finite words over an arbitrary finite alphabet Σ, for example by means of Turing machines. For computing functions on other sets M such as natural numbers, rational numbers or finite graphs, words are used as “code words” or “names” of elements of M. Under this view a machine transforms words to words without “understanding” the meaning given to them by the user. Equivalently, one can start with computable functions on the natural numbers instead of words and use numbers as “names”. Since the set Σ* of words over a finite alphabet is only countable, this method cannot be applied for introducing computability on uncountable sets M like the set ℝ of real numbers, the set of open subsets of ℝ or the set C[0; 1] of real continuous functions on the interval [0; 1].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
