• DocumentCode
    959488
  • Title

    New Results for Rado´s Sigma Function for Binary Turing Machines

  • Author

    Lynn, Donald S.

  • Author_Institution
    Computer Science Program, University of Southern California, Los Angeles, Calif. 90007.
  • Issue
    8
  • fYear
    1972
  • Firstpage
    894
  • Lastpage
    896
  • Abstract
    A computer program was written and executed to search for better lower bounds to Rado´s noncomputable sigma and shift functions for binary Turing machines. Former results in this search (called by Rado the Busy Beaver logical game) are reviewed and new bounds found by this program are presented.
  • Keywords
    Aerospace control; Arithmetic; Binary codes; Control systems; Electrons; Error correction codes; Printing; Turing machines; Variable speed drives; Vehicles; Binary Turing machine; Busy Beaver logical game; Rado´s sigma function; halting problem; noncomputable functions;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1972.5009047
  • Filename
    5009047