Hard, firm, soft … Etherealware:Computing by Temporal Order of Clocking

M. Vielhaber
{"title":"Hard, firm, soft … Etherealware:Computing by Temporal Order of Clocking","authors":"M. Vielhaber","doi":"10.5772/INTECHOPEN.80432","DOIUrl":null,"url":null,"abstract":"We define Etherealware as the concept of implementing the functionality of an algorithm by means of the clocking scheme of a cellular automaton (CA). We show, which functions can be implemented in this way, and by which CAs.","PeriodicalId":289041,"journal":{"name":"From Natural to Artificial Intelligence - Algorithms and Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"From Natural to Artificial Intelligence - Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5772/INTECHOPEN.80432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We define Etherealware as the concept of implementing the functionality of an algorithm by means of the clocking scheme of a cellular automaton (CA). We show, which functions can be implemented in this way, and by which CAs.
硬的,坚固的,软的……以太坊:按时间顺序计算
我们将以太坊定义为通过元胞自动机(CA)的时钟方案实现算法功能的概念。我们将展示哪些函数可以以这种方式实现,以及由哪些ca实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信