用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 33253|回复: 63
发表于 2025-3-21 19:17:34 | 显示全部楼层 |阅读模式
书目名称Reversibility and Universality
副标题Essays Presented to
编辑Andrew Adamatzky
视频videohttp://file.papertrans.cn/830/829408/829408.mp4
概述Offers a unique guide to universality and reversibility in computation.A tribute to Kenichi Morita’s pioneering ideas and achievements in theoretical computer science, reversibility and computationall
丛书名称Emergence, Complexity and Computation
图书封面Titlebook: Reversibility and Universality; Essays Presented to  Andrew Adamatzky Book 2018 Springer International Publishing AG 2018 Reversibility.Uni
描述.This book is a tribute to Kenichi Morita’s ideas and achievements in theoretical computer science, reversibility and computationally universal mathematical machines. It offers a unique source of information on universality and reversibility in computation and is an indispensable book for computer scientists, mathematicians, physicists and engineers. .Morita is renowned for his works on two-dimensional language accepting automata, complexity of Turing machines, universality of cellular automata, regular and context-free array grammars, and undecidability. His high-impact works include findings on parallel generation and parsing of array languages by means of reversible automata, construction of a reversible automaton from Fredkin gates, solving a firing squad synchronization problem in reversible cellular automata, self-reproduction in reversible cellular spaces, universal reversible two-counter machines, solution of nondeterministic polynomial (NP) problems in hyperbolic cellular automata, reversible P-systems, a new universal reversible logic element with memory, and reversibility in asynchronous cellular automata..Kenichi Morita’s achievements in reversibility, universality and
出版日期Book 2018
关键词Reversibility; Universality; Mathematical Machines; Theory of Computation; Logig; Cellular Automata; Turin
版次1
doihttps://doi.org/10.1007/978-3-319-73216-9
isbn_softcover978-3-030-10334-7
isbn_ebook978-3-319-73216-9Series ISSN 2194-7287 Series E-ISSN 2194-7295
issn_series 2194-7287
copyrightSpringer International Publishing AG 2018
The information of publication is updating

书目名称Reversibility and Universality影响因子(影响力)




书目名称Reversibility and Universality影响因子(影响力)学科排名




书目名称Reversibility and Universality网络公开度




书目名称Reversibility and Universality网络公开度学科排名




书目名称Reversibility and Universality被引频次




书目名称Reversibility and Universality被引频次学科排名




书目名称Reversibility and Universality年度引用




书目名称Reversibility and Universality年度引用学科排名




书目名称Reversibility and Universality读者反馈




书目名称Reversibility and Universality读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:30:25 | 显示全部楼层
发表于 2025-3-22 03:17:02 | 显示全部楼层
发表于 2025-3-22 06:47:01 | 显示全部楼层
发表于 2025-3-22 10:28:06 | 显示全部楼层
发表于 2025-3-22 15:04:18 | 显示全部楼层
Emergence, Complexity and Computationhttp://image.papertrans.cn/r/image/829408.jpg
发表于 2025-3-22 17:19:13 | 显示全部楼层
发表于 2025-3-22 21:25:48 | 显示全部楼层
Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Aueasy check and design for reversibility. After proving that CA, BCA and PCA can simulate each other, it is proven that the reversible sub-classes can also simulate each other contradicting the intuition based on decidability results. In particular, it is proven that any .-dimensional reversible CA (
发表于 2025-3-23 02:36:22 | 显示全部楼层
发表于 2025-3-23 09:27:10 | 显示全部楼层
Clean Reversible Simulations of Ranking Binary Trees,versible loops in embedded reversible simulations. We also show a clean reversible simulation that involves only one traversal. The running time and memory usage of the proposed clean reversible simulations are asymptotically equivalent to those of the original programs by Knott with intermediate ga
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-27 04:58
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表