On the complex behavior of simple tag systems -- an experimental approach
type: Item
instance of: scholarly article
title: On the complex behavior of simple tag systems -- an experimental approach
zbMATH Open document ID: 1207.68139
author: Liesbeth De Mol
published in: Theoretical Computer Science
publication date: 2011-01-10T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5834255
zbMATH Keywords: tag systems
zbMATH Keywords: computer experiments
zbMATH Keywords: decidability
zbMATH Keywords: universality
describes a project that uses: Diehard
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.08.026
OpenAlex ID: W2090766691
cites work: Q4530860
cites work: The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
cites work: An Unsolvable Problem of Elementary Number Theory
cites work: Universality of Tag Systems with P = 2
cites work: Q5321501
cites work: Q4830809
cites work: Why Gödel didn't have church's thesis
cites work: Closing the Circle: An Analysis of Emil Post's Early Work
cites work: Study of Limits of Solvability in Tag Systems
cites work: Tag systems and Collatz-like functions
cites work: Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
cites work: Q5583072
cites work: Q4782711
cites work: Computer Studies of Turing Machine Problems
cites work: Frontier between decidability and undecidability: A survey
cites work: Small Turing machines and generalized busy beaver competition
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Q5586325
cites work: Q5590814
cites work: Four Small Universal Turing Machines
cites work: Small Weakly Universal Turing Machines
cites work: P-completeness of Cellular Automaton Rule 110
cites work: The Categorization of Tag Systems in Terms of Decidability
cites work: Q4458322
cites work: Formal Reductions of the General Combinatorial Decision Problem
cites work: Q3661558
cites work: Small universal Turing machines
cites work: A Mathematical Theory of Communication
cites work: Emil Post and His Anticipation of Gödel and Turing
cites work: Cellular automata and intermediate degrees.
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: Tag systems and lag systems
cites work: 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
cites work: Q5338317
cites work: Q4323873
cites work: Q3150942
cites work: Small fast universal Turing machines
cites work: Small Semi-weakly Universal Turing Machines
cites work: Small Semi-Weakly Universal Turing Machines
DOI: 10.1016/J.TCS.2010.08.026
description: scientific article; zbMATH DE number 5834255