Advertisement

Struktur von Programmbündeln

  • B. Schinzel
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

Keywords

Tile Reducibility Partial Recursive Function Recursive Enumeration 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    FRIEDBERG, R.: Three theorems on recursive enumeration. J. Symbolic Logic 23 (1958), 309–316.Google Scholar
  2. [2]
    KHUTORETSKII, A.: On the reducibility of computable enumeration. Algebra i Logica Vol 8, No 2 (1969), 251–264.Google Scholar
  3. [3]
    MYHILL, J.: Creative Sets. Zeitschrift für Math. Logik und Grundlagen d. Mathematik 1 (1955), 97–108.Google Scholar
  4. [4]
    MYHILL, J. — SHEPHERDSON, J.C.: Effective Operations on Partial Recursive Functions. Zeitschrift f. Math. Logik und Grundlagen d. Mathematik 1 (1955).Google Scholar
  5. [5]
    ROGERS, H.: Gödelnumberings of partial recursive functions. J. Symbolic Logic 23, 1958, 331–341.Google Scholar
  6. [6]
    SCHINZEL, B.: Decomposition of Gödelnumberings into Friedbergnumberings. Zeitschrift f. Math. Logik und Grundlagen d. Mathematik, Mitte 1977.Google Scholar
  7. [7]
    WALTER, H.: Beobachtungen über die Struktur von Fasern akzeptabler Aufzählungen. Memorandum AFS 4-1976, Fachbereich Informatik der Technischen Hochschule Darmstadt.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • B. Schinzel

There are no affiliations available

Personalised recommendations