• DocumentCode
    1338230
  • Title

    Examples of Abstract Machines

  • Author

    Ginsburg, Seymour

  • Author_Institution
    System Development Corporation, Santa Monica, Calif.
  • Issue
    2
  • fYear
    1962
  • fDate
    4/1/1962 12:00:00 AM
  • Firstpage
    132
  • Lastpage
    135
  • Abstract
    Numerous physical situations related to data processing are shown to be modeled by a mathematical entity called a quasi-machine. The situations described include 1) single inputs producing multiple outputs, 2) machines yielding no outputs upon insertion of certain inputs, 3) the retention of the last n outputs only, 4) ``erase left´´ on tape, 5) different input routines doing the same work, and 6) certain types of asynchronous switching circuits. The first five may be modeled by quasi-machines with a special property, such quasi-machines being called abstract machines.
  • Keywords
    Belts; Circuit synthesis; Data processing; Mathematical model; Physics computing; Random access memory; Sequential circuits; Switching circuits;
  • fLanguage
    English
  • Journal_Title
    Electronic Computers, IRE Transactions on
  • Publisher
    ieee
  • ISSN
    0367-9950
  • Type

    jour

  • DOI
    10.1109/TEC.1962.5219345
  • Filename
    5219345