Order:
Disambiguations
Stuart A. Kurtz [6]Stuart Kurtz [1]
  1.  19
    Recursion Theory and Ordered Groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
  2.  17
    Notions of Weak Genericity.Stuart A. Kurtz - 1983 - Journal of Symbolic Logic 48 (3):764-770.
  3.  21
    Extremes in the Degrees of Inferability.Lance Fortnow, William Gasarch, Sanjay Jain, Efim Kinber, Martin Kummer, Stuart Kurtz, Mark Pleszkovich, Theodore Slaman, Robert Solovay & Frank Stephan - 1994 - Annals of Pure and Applied Logic 66 (3):231-276.
    Most theories of learning consider inferring a function f from either observations about f or, questions about f. We consider a scenario whereby the learner observes f and asks queries to some set A. If I is a notion of learning then I[A] is the set of concept classes I-learnable by an inductive inference machine with oracle A. A and B are I-equivalent if I[A] = I[B]. The equivalence classes induced are the degrees of inferability. We prove several results about (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  12
    Computational Limitations of Small-Depth Circuits.Stuart A. Kurtz & Johan Hastad - 1988 - Journal of Symbolic Logic 53 (4):1259.
  5.  42
    A Computer Scientist's Perspective on Chaos and Mystery.Stuart A. Kurtz - 2002 - Zygon 37 (2):415-420.
  6.  11
    Håstad Johan. Computational Limitations of Small-Depth Circuits. ACM Doctoral Dissertation Awards. The MIT Press, Cambridge, Mass., and London, 1987, Xiii + 84 Pp. [REVIEW]Stuart A. Kurtz - 1988 - Journal of Symbolic Logic 53 (4):1259-1260.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark