Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   595 citations  
  • (2 other versions)Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • (1 other version)On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Mathematical Logic Quarterly 24 (13‐14):207-224.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (13-14):207-224.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-5cf77db6b5-fpc68 uwo