找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Reversibility and Universality; Essays Presented to Andrew Adamatzky Book 2018 Springer International Publishing AG 2018 Reversibility.Uni

[复制链接]
楼主: ACRO
发表于 2025-3-26 23:26:50 | 显示全部楼层
A Snapshot of My Life,I made several logic circuits for digital apparatus, for example a digital clock, using ICs also as a hobby. At that time, I dreamed to assemble a small digital computer out of TTL ICs, but, of course, it was not possible for me.
发表于 2025-3-27 03:09:22 | 显示全部楼层
An Overview of 2D Picture Array Generating Models Based on Membrane Computing, in the literature. The objective of this survey is to review and describe the salient features of the major types of array P systems, which have served as the basis for developing other kinds of array P systems. Applications of these array P systems are also briefly described besides indicating possible new directions of investigation.
发表于 2025-3-27 07:33:57 | 显示全部楼层
发表于 2025-3-27 11:51:25 | 显示全部楼层
发表于 2025-3-27 15:48:31 | 显示全部楼层
发表于 2025-3-27 20:04:21 | 显示全部楼层
Abelian Invertible Automata,inary tree. In the recent past, automata groups have become a major source of interesting and challenging constructions in group theory. While this research typically focuses on properties of the associated groups, we describe the topological structure of the associated automata in the special case
发表于 2025-3-27 22:53:52 | 显示全部楼层
Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Auversality in the context of Reversible Cellular Automata. Cellular automata (CA) are mappings over infinite lattices such that all cells are updated synchronously according to the states around each one and a common local function. A CA is reversible if its global function is invertible and its inve
发表于 2025-3-28 05:13:56 | 显示全部楼层
发表于 2025-3-28 07:12:23 | 显示全部楼层
Cellular Automata: Descriptional Complexity and Decidability, a fixed number of cells. For the former models so-called . can be shown, that is, the savings in size that such automata may provide are not bounded by any recursive function. A consequence is that almost all commonly studied decidability questions are undecidable and not even semidecidable for suc
发表于 2025-3-28 11:49:01 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-22 02:02
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表