東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Reversible computing." ]

切換: 標籤 | MARC模式 | ISBD

Theory of reversible computing

Morita, Kenichi.

FindBook

Google Book

Amazon

博客來

Theory of reversible computing

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory of reversible computing/ by Kenichi Morita.
作者:	Morita, Kenichi.
出版者:	Tokyo :Springer Japan : : 2017.,
面頁冊數:	xvii, 457 p. :digital ;24 cm.
內容註:	1. Introduction -- 2. Reversible Logic Elements with Memory -- 3. Classification of Reversible Logic Elements with Memory and Their Universality -- 4. Reversible Logic Gates -- 5. Reversible Turing Machines -- 6. Making Reversible Turing Machines from Reversible Primitives -- 7. Universal Reversible Turing Machines -- 8. Space-Bounded Reversible Turing Machines -- 9. Other Models of Reversible Machines -- 10. Reversible Cellular Automata -- 11. One-Dimensional Universal Reversible Cellular Automata -- 12. Two-Dimensional Universal Reversible Cellular Automata -- 13. Reversible Elementary Triangular Partitioned Cellular Automata -- 14. Self-reproduction in Reversible Cellular Automata.
Contained By:	Springer eBooks
標題:	Reversible computing. -
電子資源:	http://dx.doi.org/10.1007/978-4-431-56606-9
ISBN:	9784431566069

Theory of reversible computing
Morita, Kenichi.

Theory of reversible computing[electronic resource] /by Kenichi Morita. - Tokyo :Springer Japan :2017. - xvii, 457 p. :digital ;24 cm. - Monographs in theoretical computer science. an EATCS series,1431-2654. - Monographs in theoretical computer science. an EATCS series..

1. Introduction -- 2. Reversible Logic Elements with Memory -- 3. Classification of Reversible Logic Elements with Memory and Their Universality -- 4. Reversible Logic Gates -- 5. Reversible Turing Machines -- 6. Making Reversible Turing Machines from Reversible Primitives -- 7. Universal Reversible Turing Machines -- 8. Space-Bounded Reversible Turing Machines -- 9. Other Models of Reversible Machines -- 10. Reversible Cellular Automata -- 11. One-Dimensional Universal Reversible Cellular Automata -- 12. Two-Dimensional Universal Reversible Cellular Automata -- 13. Reversible Elementary Triangular Partitioned Cellular Automata -- 14. Self-reproduction in Reversible Cellular Automata.

This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utilized in computing. A reversible computing system is a "backward deterministic" system such that every state of the system has at most one predecessor. Although its definition is very simple, it is closely related to physical reversibility, one of the fundamental microscopic laws of Nature. Authored by the leading scientist on the subject, this book serves as a valuable reference work for anyone working in reversible computation or in automata theory in general. This work deals with various reversible computing models at several different levels, which range from the microscopic to the macroscopic, and aims to clarify how computation can be carried out efficiently and elegantly in these reversible computing models. Because the construction methods are often unique and different from those in the traditional methods, these computing models as well as the design methods provide new insights for future computing systems. Organized bottom-up, the book starts with the lowest scale of reversible logic elements and circuits made from them. This is followed by reversible Turing machines, the most basic computationally universal machines, and some other types of reversible automata such as reversible multi-head automata and reversible counter machines. The text concludes with reversible cellular automata for massively parallel spatiotemporal computation. In order to help the reader have a clear understanding of each model, the presentations of all different models follow a similar pattern: the model is given in full detail, a short informal discussion is held on the role of different elements of the model, and an example with illustrations follows each model.

ISBN: 9784431566069

Standard No.: 10.1007/978-4-431-56606-9doiSubjects--Topical Terms:

2114958
Reversible computing.

LC Class. No.: QA76.9.R48

Dewey Class. No.: 004

Theory of reversible computing
LDR:03578nmm a2200349 a 4500 001 2112281
003 DE-He213
005 20171107044400.0
006 m d
007 cr nn 008maaau
008 180719s2017 ja s 0 eng d
020 $a 9784431566069 $q (electronic bk.)
020 $a 9784431566045 $q (paper)
024 7 $a 10.1007/978-4-431-56606-9 $2 doi
035 $a 978-4-431-56606-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.R48
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 004 $2 23
090 $a QA76.9.R48 $b M862 2017
100 1 $a Morita, Kenichi. $3 3269807
245 1 0 $a Theory of reversible computing $h [electronic resource] / $c by Kenichi Morita.
260 $a Tokyo : $b Springer Japan : $b Imprint: Springer, $c 2017.
300 $a xvii, 457 p. : $b digital ; $c 24 cm.
490 1 $a Monographs in theoretical computer science. an EATCS series, $x 1431-2654
505 0 $a 1. Introduction -- 2. Reversible Logic Elements with Memory -- 3. Classification of Reversible Logic Elements with Memory and Their Universality -- 4. Reversible Logic Gates -- 5. Reversible Turing Machines -- 6. Making Reversible Turing Machines from Reversible Primitives -- 7. Universal Reversible Turing Machines -- 8. Space-Bounded Reversible Turing Machines -- 9. Other Models of Reversible Machines -- 10. Reversible Cellular Automata -- 11. One-Dimensional Universal Reversible Cellular Automata -- 12. Two-Dimensional Universal Reversible Cellular Automata -- 13. Reversible Elementary Triangular Partitioned Cellular Automata -- 14. Self-reproduction in Reversible Cellular Automata.
520 $a This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utilized in computing. A reversible computing system is a "backward deterministic" system such that every state of the system has at most one predecessor. Although its definition is very simple, it is closely related to physical reversibility, one of the fundamental microscopic laws of Nature. Authored by the leading scientist on the subject, this book serves as a valuable reference work for anyone working in reversible computation or in automata theory in general. This work deals with various reversible computing models at several different levels, which range from the microscopic to the macroscopic, and aims to clarify how computation can be carried out efficiently and elegantly in these reversible computing models. Because the construction methods are often unique and different from those in the traditional methods, these computing models as well as the design methods provide new insights for future computing systems. Organized bottom-up, the book starts with the lowest scale of reversible logic elements and circuits made from them. This is followed by reversible Turing machines, the most basic computationally universal machines, and some other types of reversible automata such as reversible multi-head automata and reversible counter machines. The text concludes with reversible cellular automata for massively parallel spatiotemporal computation. In order to help the reader have a clear understanding of each model, the presentations of all different models follow a similar pattern: the model is given in full detail, a short informal discussion is held on the role of different elements of the model, and an example with illustrations follows each model.
650 0 $a Reversible computing. $3 2114958
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Computer Engineering. $3 1567821
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Monographs in theoretical computer science. an EATCS series. $3 1620918
856 4 0 $u http://dx.doi.org/10.1007/978-4-431-56606-9
950 $a Computer Science (Springer-11645)