3. Naming Systems

  • Klaus Weihrauch
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)


So far we have defined computability on the sets Σ* of finite words and Σω of infinite sequences explicitly by Type-2 machines (Sect. 2.1). In TTE we introduce computability on other sets M by using finite or infinite words as “names”. Machines, therefore, still transform “concrete” sequences of symbols. Only the user of the machine interprets theses sequences as finite or infinite names of “abstract objects”. Although there are several other suggestions to define computability on sets or structures, in this book we will confine ourselves exclusively to computability concepts induced by naming systems. As we have seen, some concepts from computability theory have formally similar topological counterparts. In the following we will continue to develop computability theory, considering also the weaker topological aspects whenever advisable.


Topological Space Choice Function Infinite Sequence Computable Function Naming System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.Fachbereich Informatik Theoretische Informatik IFern Universität HagenHagenGermany

Personalised recommendations