Please use this identifier to cite or link to this item:
http://localhost/handle/Hannan/1875
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Morita, Ken'ichi ; (Researcher in natural computation) ; | en_US |
| dc.date.accessioned | 2013 | en_US |
| dc.date.accessioned | 2020-05-17T08:33:43Z | - |
| dc.date.available | 2020-05-17T08:33:43Z | - |
| dc.date.issued | 2017 | en_US |
| dc.identifier.isbn | 9784431566069 ; (electronic bk.) ; | en_US |
| dc.identifier.isbn | 4431566066 ; (electronic bk.) ; | en_US |
| dc.identifier.isbn | 9784431566045 ; | en_US |
| dc.identifier.isbn | 443156604X ; | en_US |
| dc.identifier.uri | http://localhost/handle/Hannan/1875 | - |
| dc.description | Ohio Library and Information Network ; | en_US |
| dc.description | Available to OhioLINK libraries ; | en_US |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | Print version: ; Morita, Kenichi ; Theory of Reversible Computing ; Tokyo : Springer Japan,c2017 ; 9784431566045 ; | en_US |
| dc.description | en_US | |
| dc.description.statementofresponsibility | Kenichi Morita | en_US |
| dc.description.tableofcontents | ""Preface""; ""Contents""; ""Acronyms""; ""1 Introduction""; ""1.1 Reversibility in Physics and Computing""; ""1.2 Significance of Reversible Computing""; ""1.3 Scope of This Volume""; ""1.3.1 Organization of this book""; ""1.3.2 Related studies and references""; ""1.4 Terminology and Notations""; ""References""; ""2 Reversible Logic Elements with Memory""; ""2.1 Logical Primitives for Reversible Computers""; ""2.2 Reversible Logic Element with Memory (RLEM)""; ""2.2.1 Rotary element (RE), a typical RLEM""; ""2.2.2 Circuit composed of REs""; ""2.2.3 Realizing RE in the billiard ball model"" ; | en_US |
| dc.description.tableofcontents | ""2.3 Making Reversible Sequential Machines (RSMs) from RE""""2.3.1 RE-column, a building module for RSMs""; ""2.3.2 Composing reversible sequential machines by RE-columns""; ""2.4 Concluding Remarks""; ""References""; ""3 Classification of Reversible Logic Elements with Memory and Their Universality""; ""3.1 Classification of RLEMs""; ""3.1.1 Graphical representation of RLEMs""; ""3.1.2 Equivalence in RLEMs""; ""3.1.3 Degeneracy in RLEMs""; ""3.1.4 Classification of 2-, 3- and 4-symbol RLEMs""; ""3.2 Universality of All Non-degenerate 2-State RLEMs with Three or More Symbols"" ; | en_US |
| dc.description.tableofcontents | ""3.2.1 Realizing RE using non-degenerate 3-symbol RLEMs""""3.2.2 Making a non-degenerate (k-1)-symbol RLEM from a non-degenerate k-symbol RLEMs""; ""3.3 Systematic Construction of RSMs out of Universal RLEMs""; ""3.4 Compact Realization of RSMs Using RLEMs 4-31 and 3-7""; ""3.5 Frontier Between Universal and Non-universal RLEMs""; ""3.5.1 Definitions on RLEM-circuits""; ""3.5.2 Non-universality of three kinds of 2-state 2-symbol RLEMs""; ""3.5.3 Universality of combinations of 2-state 2-symbol RLEMs""; ""3.6 Realizing 4-Symbol RLEMs in the Billiard Ball Model""; ""3.7 Concluding Remarks"" ; | en_US |
| dc.description.tableofcontents | ""5 Reversible Turing Machines""""5.1 Turing Machines and Reversibility""; ""5.1.1 Basic definitions on reversible Turing machines (RTMs)""; ""5.1.2 Notion of simulation and computational universality""; ""5.1.3 Conversion between the quadruple and quintuple forms""; ""5.1.4 Inverse reversible Turing machines""; ""5.2 Converting Irreversible Turing Machines to Reversible Ones""; ""5.2.1 Three-tape Turing machines""; ""5.2.2 Inverse three-tape Turing machines""; ""5.2.3 Computational universality of three-tape RTMs""; ""5.3 Variations of Reversible Turing Machines"" ; | en_US |
| dc.format.extent | 1 online resource (463 p.) ; | en_US |
| dc.format.extent | ""References""""4 Reversible Logic Gates""; ""4.1 Reversible Logic Gates and Circuits""; ""4.1.1 Reversible logic gates""; ""4.1.2 Reversible combinatorial logic circuits""; ""4.1.3 Logical universality of reversible logic ga | en_US |
| dc.publisher | Springer, | en_US |
| dc.relation.ispartofseries | Monographs in Theoretical Computer Science ; | en_US |
| dc.relation.ispartofseries | Monographs in theoretical computer science ; | en_US |
| dc.relation.haspart | 9784431566069.pdf | en_US |
| dc.subject | Reversible computing ; | en_US |
| dc.title | Theory of reversible computing | en_US |
| dc.type | Book | en_US |
| dc.publisher.place | Tokyo : | en_US |
| dc.classification.lc | QA76.9.R48 ; | en_US |
| Appears in Collections: | مهندسی فناوری اطلاعات | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 9784431566069.pdf | 8.55 MB | Adobe PDF |  Preview File |
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Morita, Ken'ichi ; (Researcher in natural computation) ; | en_US |
| dc.date.accessioned | 2013 | en_US |
| dc.date.accessioned | 2020-05-17T08:33:43Z | - |
| dc.date.available | 2020-05-17T08:33:43Z | - |
| dc.date.issued | 2017 | en_US |
| dc.identifier.isbn | 9784431566069 ; (electronic bk.) ; | en_US |
| dc.identifier.isbn | 4431566066 ; (electronic bk.) ; | en_US |
| dc.identifier.isbn | 9784431566045 ; | en_US |
| dc.identifier.isbn | 443156604X ; | en_US |
| dc.identifier.uri | http://localhost/handle/Hannan/1875 | - |
| dc.description | Ohio Library and Information Network ; | en_US |
| dc.description | Available to OhioLINK libraries ; | en_US |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | Print version: ; Morita, Kenichi ; Theory of Reversible Computing ; Tokyo : Springer Japan,c2017 ; 9784431566045 ; | en_US |
| dc.description | en_US | |
| dc.description.statementofresponsibility | Kenichi Morita | en_US |
| dc.description.tableofcontents | ""Preface""; ""Contents""; ""Acronyms""; ""1 Introduction""; ""1.1 Reversibility in Physics and Computing""; ""1.2 Significance of Reversible Computing""; ""1.3 Scope of This Volume""; ""1.3.1 Organization of this book""; ""1.3.2 Related studies and references""; ""1.4 Terminology and Notations""; ""References""; ""2 Reversible Logic Elements with Memory""; ""2.1 Logical Primitives for Reversible Computers""; ""2.2 Reversible Logic Element with Memory (RLEM)""; ""2.2.1 Rotary element (RE), a typical RLEM""; ""2.2.2 Circuit composed of REs""; ""2.2.3 Realizing RE in the billiard ball model"" ; | en_US |
| dc.description.tableofcontents | ""2.3 Making Reversible Sequential Machines (RSMs) from RE""""2.3.1 RE-column, a building module for RSMs""; ""2.3.2 Composing reversible sequential machines by RE-columns""; ""2.4 Concluding Remarks""; ""References""; ""3 Classification of Reversible Logic Elements with Memory and Their Universality""; ""3.1 Classification of RLEMs""; ""3.1.1 Graphical representation of RLEMs""; ""3.1.2 Equivalence in RLEMs""; ""3.1.3 Degeneracy in RLEMs""; ""3.1.4 Classification of 2-, 3- and 4-symbol RLEMs""; ""3.2 Universality of All Non-degenerate 2-State RLEMs with Three or More Symbols"" ; | en_US |
| dc.description.tableofcontents | ""3.2.1 Realizing RE using non-degenerate 3-symbol RLEMs""""3.2.2 Making a non-degenerate (k-1)-symbol RLEM from a non-degenerate k-symbol RLEMs""; ""3.3 Systematic Construction of RSMs out of Universal RLEMs""; ""3.4 Compact Realization of RSMs Using RLEMs 4-31 and 3-7""; ""3.5 Frontier Between Universal and Non-universal RLEMs""; ""3.5.1 Definitions on RLEM-circuits""; ""3.5.2 Non-universality of three kinds of 2-state 2-symbol RLEMs""; ""3.5.3 Universality of combinations of 2-state 2-symbol RLEMs""; ""3.6 Realizing 4-Symbol RLEMs in the Billiard Ball Model""; ""3.7 Concluding Remarks"" ; | en_US |
| dc.description.tableofcontents | ""5 Reversible Turing Machines""""5.1 Turing Machines and Reversibility""; ""5.1.1 Basic definitions on reversible Turing machines (RTMs)""; ""5.1.2 Notion of simulation and computational universality""; ""5.1.3 Conversion between the quadruple and quintuple forms""; ""5.1.4 Inverse reversible Turing machines""; ""5.2 Converting Irreversible Turing Machines to Reversible Ones""; ""5.2.1 Three-tape Turing machines""; ""5.2.2 Inverse three-tape Turing machines""; ""5.2.3 Computational universality of three-tape RTMs""; ""5.3 Variations of Reversible Turing Machines"" ; | en_US |
| dc.format.extent | 1 online resource (463 p.) ; | en_US |
| dc.format.extent | ""References""""4 Reversible Logic Gates""; ""4.1 Reversible Logic Gates and Circuits""; ""4.1.1 Reversible logic gates""; ""4.1.2 Reversible combinatorial logic circuits""; ""4.1.3 Logical universality of reversible logic ga | en_US |
| dc.publisher | Springer, | en_US |
| dc.relation.ispartofseries | Monographs in Theoretical Computer Science ; | en_US |
| dc.relation.ispartofseries | Monographs in theoretical computer science ; | en_US |
| dc.relation.haspart | 9784431566069.pdf | en_US |
| dc.subject | Reversible computing ; | en_US |
| dc.title | Theory of reversible computing | en_US |
| dc.type | Book | en_US |
| dc.publisher.place | Tokyo : | en_US |
| dc.classification.lc | QA76.9.R48 ; | en_US |
| Appears in Collections: | مهندسی فناوری اطلاعات | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 9784431566069.pdf | 8.55 MB | Adobe PDF | Preview File |
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Morita, Ken'ichi ; (Researcher in natural computation) ; | en_US |
| dc.date.accessioned | 2013 | en_US |
| dc.date.accessioned | 2020-05-17T08:33:43Z | - |
| dc.date.available | 2020-05-17T08:33:43Z | - |
| dc.date.issued | 2017 | en_US |
| dc.identifier.isbn | 9784431566069 ; (electronic bk.) ; | en_US |
| dc.identifier.isbn | 4431566066 ; (electronic bk.) ; | en_US |
| dc.identifier.isbn | 9784431566045 ; | en_US |
| dc.identifier.isbn | 443156604X ; | en_US |
| dc.identifier.uri | http://localhost/handle/Hannan/1875 | - |
| dc.description | Ohio Library and Information Network ; | en_US |
| dc.description | Available to OhioLINK libraries ; | en_US |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | en_US | |
| dc.description | Print version: ; Morita, Kenichi ; Theory of Reversible Computing ; Tokyo : Springer Japan,c2017 ; 9784431566045 ; | en_US |
| dc.description | en_US | |
| dc.description.statementofresponsibility | Kenichi Morita | en_US |
| dc.description.tableofcontents | ""Preface""; ""Contents""; ""Acronyms""; ""1 Introduction""; ""1.1 Reversibility in Physics and Computing""; ""1.2 Significance of Reversible Computing""; ""1.3 Scope of This Volume""; ""1.3.1 Organization of this book""; ""1.3.2 Related studies and references""; ""1.4 Terminology and Notations""; ""References""; ""2 Reversible Logic Elements with Memory""; ""2.1 Logical Primitives for Reversible Computers""; ""2.2 Reversible Logic Element with Memory (RLEM)""; ""2.2.1 Rotary element (RE), a typical RLEM""; ""2.2.2 Circuit composed of REs""; ""2.2.3 Realizing RE in the billiard ball model"" ; | en_US |
| dc.description.tableofcontents | ""2.3 Making Reversible Sequential Machines (RSMs) from RE""""2.3.1 RE-column, a building module for RSMs""; ""2.3.2 Composing reversible sequential machines by RE-columns""; ""2.4 Concluding Remarks""; ""References""; ""3 Classification of Reversible Logic Elements with Memory and Their Universality""; ""3.1 Classification of RLEMs""; ""3.1.1 Graphical representation of RLEMs""; ""3.1.2 Equivalence in RLEMs""; ""3.1.3 Degeneracy in RLEMs""; ""3.1.4 Classification of 2-, 3- and 4-symbol RLEMs""; ""3.2 Universality of All Non-degenerate 2-State RLEMs with Three or More Symbols"" ; | en_US |
| dc.description.tableofcontents | ""3.2.1 Realizing RE using non-degenerate 3-symbol RLEMs""""3.2.2 Making a non-degenerate (k-1)-symbol RLEM from a non-degenerate k-symbol RLEMs""; ""3.3 Systematic Construction of RSMs out of Universal RLEMs""; ""3.4 Compact Realization of RSMs Using RLEMs 4-31 and 3-7""; ""3.5 Frontier Between Universal and Non-universal RLEMs""; ""3.5.1 Definitions on RLEM-circuits""; ""3.5.2 Non-universality of three kinds of 2-state 2-symbol RLEMs""; ""3.5.3 Universality of combinations of 2-state 2-symbol RLEMs""; ""3.6 Realizing 4-Symbol RLEMs in the Billiard Ball Model""; ""3.7 Concluding Remarks"" ; | en_US |
| dc.description.tableofcontents | ""5 Reversible Turing Machines""""5.1 Turing Machines and Reversibility""; ""5.1.1 Basic definitions on reversible Turing machines (RTMs)""; ""5.1.2 Notion of simulation and computational universality""; ""5.1.3 Conversion between the quadruple and quintuple forms""; ""5.1.4 Inverse reversible Turing machines""; ""5.2 Converting Irreversible Turing Machines to Reversible Ones""; ""5.2.1 Three-tape Turing machines""; ""5.2.2 Inverse three-tape Turing machines""; ""5.2.3 Computational universality of three-tape RTMs""; ""5.3 Variations of Reversible Turing Machines"" ; | en_US |
| dc.format.extent | 1 online resource (463 p.) ; | en_US |
| dc.format.extent | ""References""""4 Reversible Logic Gates""; ""4.1 Reversible Logic Gates and Circuits""; ""4.1.1 Reversible logic gates""; ""4.1.2 Reversible combinatorial logic circuits""; ""4.1.3 Logical universality of reversible logic ga | en_US |
| dc.publisher | Springer, | en_US |
| dc.relation.ispartofseries | Monographs in Theoretical Computer Science ; | en_US |
| dc.relation.ispartofseries | Monographs in theoretical computer science ; | en_US |
| dc.relation.haspart | 9784431566069.pdf | en_US |
| dc.subject | Reversible computing ; | en_US |
| dc.title | Theory of reversible computing | en_US |
| dc.type | Book | en_US |
| dc.publisher.place | Tokyo : | en_US |
| dc.classification.lc | QA76.9.R48 ; | en_US |
| Appears in Collections: | مهندسی فناوری اطلاعات | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 9784431566069.pdf | 8.55 MB | Adobe PDF | Preview File |