找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 33331|回復(fù): 63
樓主
發(fā)表于 2025-3-21 19:17:34 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Reversibility and Universality
副標(biāo)題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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Reversibility and Universality網(wǎng)絡(luò)公開度




書目名稱Reversibility and Universality網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Reversibility and Universality被引頻次




書目名稱Reversibility and Universality被引頻次學(xué)科排名




書目名稱Reversibility and Universality年度引用




書目名稱Reversibility and Universality年度引用學(xué)科排名




書目名稱Reversibility and Universality讀者反饋




書目名稱Reversibility and Universality讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:30:25 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:17:02 | 只看該作者
地板
發(fā)表于 2025-3-22 06:47:01 | 只看該作者
5#
發(fā)表于 2025-3-22 10:28:06 | 只看該作者
6#
發(fā)表于 2025-3-22 15:04:18 | 只看該作者
Emergence, Complexity and Computationhttp://image.papertrans.cn/r/image/829408.jpg
7#
發(fā)表于 2025-3-22 17:19:13 | 只看該作者
8#
發(fā)表于 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 (
9#
發(fā)表于 2025-3-23 02:36:22 | 只看該作者
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-23 04:22
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
平武县| 新沂市| 济源市| 汽车| 民丰县| 金湖县| 博野县| 呼和浩特市| 尚志市| 特克斯县| 鱼台县| 禹城市| 彰武县| 仪征市| 惠来县| 仁化县| 汉寿县| 临澧县| 梁山县| 大名县| 黄平县| 蕲春县| 河北区| 大新县| 闻喜县| 洪雅县| 江油市| 宁城县| 河源市| 龙岩市| 青河县| 友谊县| 惠来县| 娱乐| 台南县| 湘阴县| 龙陵县| 靖宇县| 宜都市| 望奎县| 宜昌市|