5 found
Order:
  1.  9
    A characterization of complexity sequences.C. P. Schnorr & G. Stumpf - 1975 - Mathematical Logic Quarterly 21 (1):47-56.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  23
    A Gödel Theorem on Network Complexity Lower Bounds.C. P. Schnorr - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (19-24):377-384.
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  5
    A Gödel Theorem on Network Complexity Lower Bounds.C. P. Schnorr - 1986 - Mathematical Logic Quarterly 32 (19‐24):377-384.
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  34
    General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.
    We formalise the notion of those infinite binary sequences z that admit a single program P which expresses the entire algorithmical structure of z. Such a program P minimizes the information which must be used in a relative computation for z. We propose two concepts with different strength for this notion, the learnable and the super-learnable sequences. We establish three different equivalent characterizations of learnable (super-learnable, resp.) sequences. In particular, we prove that a sequences z is learnable (super-learnable, resp.) if (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  6
    Kruse Arthur H.. Some notions of random sequence and their set-theoretic foundations. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 299–322. [REVIEW]C. P. Schnorr - 1973 - Journal of Symbolic Logic 38 (3):530-531.