Pages that link to "Item:Q1575913"

The following pages link to Frontier between decidability and undecidability: A survey (Q1575913):

Displaying 16 items.

• On Goles' universal machines: a computational point of view (Q393156) (← links)
• Fractal dimension versus process complexity (Q504699) (← links)
• On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
• Small Turing machines and generalized busy beaver competition (Q703533) (← links)
• The complexity of small universal Turing machines: A survey (Q1004087) (← links)
• The power of reachability testing for timed automata (Q1399974) (← links)
• Abstract geometrical computation. VIII: Small machines, accumulations \& rationality (Q1672012) (← links)
• Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
• The word problem for one-relation monoids: a survey (Q1982573) (← links)
• Tag systems and Collatz-like functions (Q2474075) (← links)
• Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
• The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
• Small Universal Devices (Q2944894) (← links)
• ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON (Q3043622) (← links)
• Universality in Molecular and Cellular Computing (Q3195684) (← links)
• Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)