4 found
  1.  4
    [Omnibus Review].James S. Royer - 1999 - Journal of Symbolic Logic 64 (2):914-916.
    Neil D. Jones, Computability and Complexity. From a Programming Perspective.Neil D. Jones, T. AE. Mogensen, Computability by Functional Languages.M. H. Sorensen, Hilbert's Tenth Problem.A. M. Ben-Amram, The Existence of Optimal Algorithms.
    Direct download  
    Export citation  
    Bookmark   2 citations  
  2.  11
    Two Recursion Theoretic Characterizations of Proof Speed-Ups.James S. Royer - 1989 - Journal of Symbolic Logic 54 (2):522-526.
  3.  8
    Jones Neil D., Computability and Complexity, From a Programming Perspective, Foundations of Computing, The MIT Press, Cambridge, Mass., and London, 1997, Xvi + 466 Pp. [REVIEW]James S. Royer - 1999 - Journal of Symbolic Logic 64 (2):914-916.
    Direct download (3 more)  
    Export citation  
  4.  4
    Generality’s Price: Inescapable Deficiencies in Machine-Learned Programs.John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle & James S. Royer - 2006 - Annals of Pure and Applied Logic 139 (1):303-326.
    This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some successfully learned programs is provably unalterably suboptimal. There are also results in which the complexity of successfully learned programs is asymptotically optimal and the learning device is general, but, still thanks to the generality, some of (...)
    Direct download (6 more)  
    Export citation