{"title":"抽象机器的例子","authors":"S. Ginsburg","doi":"10.1109/TEC.1962.5219345","DOIUrl":null,"url":null,"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.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"57 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1962-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Examples of Abstract Machines\",\"authors\":\"S. Ginsburg\",\"doi\":\"10.1109/TEC.1962.5219345\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":177496,\"journal\":{\"name\":\"IRE Trans. Electron. Comput.\",\"volume\":\"57 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1962-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IRE Trans. Electron. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TEC.1962.5219345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IRE Trans. Electron. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEC.1962.5219345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.