FCT 2009 - PDF Preprint Papers

FCT 2009 Fundamentals of Computation Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FCT-2009 Paper

click to vote

FCT
2009
Springer

198views Applied Computing» more FCT 2009»

Small Weakly Universal Turing Machines

13 years 11 months ago

Download www.dna.caltech.edu

We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an inﬁnitely repeate...

Turlough Neary, Damien Woods

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	198	Small Weakly Universal Turing Machines	claim
2	191	Closure Operators for Order Structures	claim
3	189	Alternating Weighted Automata	claim
4	171	Martingales on Trees and the Empire Chromatic Number of Random Trees	claim
5	167	Maintaining Arrays of Contiguous Objects	claim
6	160	Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies	claim
7	156	Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity	claim
8	146	Equivalence of Deterministic Nested Word to Word Transducers	claim
9	146	Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space	claim
10	145	Energy Complexity and Depth of Threshold Circuits	claim
11	132	Correcting Sorted Sequences in a Single Hop Radio Network	claim
12	131	1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs	claim
13	130	Earliest Query Answering for Deterministic Nested Word Automata	claim
14	126	Computing Role Assignments of Chordal Graphs	claim
15	126	Multiway In-Place Merging	claim
16	117	Noise-Resilient Group Testing: Limitations and Constructions	claim
17	111	Directed Graphs of Entanglement Two	claim
18	110	Small-Space Analogues of Valiant's Classes	claim
19	108	On Random Betweenness Constraints	claim
20	107	Depletable Channels: Dynamics and Behaviour	claim
21	105	Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL	claim
22	105	On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs	claim
23	103	Open Maps Bisimulations for Higher Dimensional Automata Models	claim
24	86	Independence Results for n-Ary Recursion Theorems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers