A generalized computability thesis

  • Klaus Weihrauch
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Let M := [F;G], i.e. the smallest set including G which is closed under the functions from F, where F and G are finite. Any numbering v of M implies v-computability on M. The effective numberings of M with respect to F are defined in two equivalent ways, firstly as the class of numberings equivalent to the term numbering, and secondly as the minimal numbering (with respect to many-one reducibility) in the class of those numberings for which the functions from F become computable.

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.Lehrstuhl für Informatik IRWTH AachenAachen

Personalised recommendations