Academic Journal
The group of reversible turing machines: subgroups, generators, and computability – CORRIGENDUM.
| Τίτλος: | The group of reversible turing machines: subgroups, generators, and computability – CORRIGENDUM. |
|---|---|
| Πηγή: | Forum of Mathematics, Sigma; 2025, Vol. 13, p1-42, 42p |
| Θεματικοί όροι: | Turing machines, Reversible computing, Program generators (Computer programs), Subgroup analysis (Experimental design), Finite state machines, Recursion theory |
| Περίληψη: | The article focuses on the study of an abstract group of reversible Turing machines, exploring their subgroups, generators, and computability aspects. It identifies three significant subgroups: the group of finite-state automata, the group of oblivious Turing machines, and the group of elementary Turing machines. The authors demonstrate that while the groups of oblivious and elementary Turing machines are finitely generated, the groups of finite-state automata and reversible Turing machines are not. Additionally, the article discusses the undecidability of the torsion problem for certain groups, including the group of elementary Turing machines, and establishes connections to cellular automata and topological dynamics. The findings contribute to the understanding of the computational properties and limitations of these abstract machines. [Extracted from the article] |
| Copyright of Forum of Mathematics, Sigma is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:edb&genre=article&issn=20505094&ISBN=&volume=13&issue=&date=20250101&spage=1&pages=1-42&title=Forum of Mathematics, Sigma&atitle=The%20group%20of%20reversible%20turing%20machines%3A%20subgroups%2C%20generators%2C%20and%20computability%20%E2%80%93%20CORRIGENDUM.&aulast=&id=DOI:10.1017/fms.2025.10142 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 191132335 RelevancyScore: 984 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 983.694702148438 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: The group of reversible turing machines: subgroups, generators, and computability – CORRIGENDUM. – Name: TitleSource Label: Source Group: Src Data: Forum of Mathematics, Sigma; 2025, Vol. 13, p1-42, 42p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Turing+machines%22">Turing machines</searchLink><br /><searchLink fieldCode="DE" term="%22Reversible+computing%22">Reversible computing</searchLink><br /><searchLink fieldCode="DE" term="%22Program+generators+%28Computer+programs%29%22">Program generators (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Subgroup+analysis+%28Experimental+design%29%22">Subgroup analysis (Experimental design)</searchLink><br /><searchLink fieldCode="DE" term="%22Finite+state+machines%22">Finite state machines</searchLink><br /><searchLink fieldCode="DE" term="%22Recursion+theory%22">Recursion theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The article focuses on the study of an abstract group of reversible Turing machines, exploring their subgroups, generators, and computability aspects. It identifies three significant subgroups: the group of finite-state automata, the group of oblivious Turing machines, and the group of elementary Turing machines. The authors demonstrate that while the groups of oblivious and elementary Turing machines are finitely generated, the groups of finite-state automata and reversible Turing machines are not. Additionally, the article discusses the undecidability of the torsion problem for certain groups, including the group of elementary Turing machines, and establishes connections to cellular automata and topological dynamics. The findings contribute to the understanding of the computational properties and limitations of these abstract machines. [Extracted from the article] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Forum of Mathematics, Sigma is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=191132335 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1017/fms.2025.10142 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 42 StartPage: 1 Subjects: – SubjectFull: Turing machines Type: general – SubjectFull: Reversible computing Type: general – SubjectFull: Program generators (Computer programs) Type: general – SubjectFull: Subgroup analysis (Experimental design) Type: general – SubjectFull: Finite state machines Type: general – SubjectFull: Recursion theory Type: general Titles: – TitleFull: The group of reversible turing machines: subgroups, generators, and computability – CORRIGENDUM. Type: main BibRelationships: IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 20505094 Numbering: – Type: volume Value: 13 Titles: – TitleFull: Forum of Mathematics, Sigma Type: main |
| ResultId | 1 |