抽象机器的例子

S. Ginsburg
{"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}
引用次数: 20

摘要

许多与数据处理相关的物理情况被证明是由称为准机器的数学实体建模的。所描述的情况包括1)单输入产生多个输出,2)机器在插入某些输入后不产生输出,3)仅保留最后n个输出,4)磁带上的“左擦除”,5)不同的输入程序做同样的工作,6)某些类型的异步切换电路。前五种可以用具有特殊性质的准机器来建模,这种准机器被称为抽象机器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Examples of Abstract Machines
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信