Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
34
click to vote
CIE
2007
Springer
favorite
Email
discuss
report
108
views
Applied Computing
»
more
CIE 2007
»
The Complexity of Small Universal Turing Machines
14 years 5 months ago
Download
www.bcri.ucc.ie
Damien Woods, Turlough Neary
Real-time Traffic
CIE 2007
|
claim paper
Related Content
»
On the time complexity of 2tag systems and small universal Turing machines
»
Quantum complexity theory
»
Small Weakly Universal Turing Machines
»
Four Small Universal Turing Machines
»
Small Turing universal signal machines
»
Small Semiweakly Universal Turing Machines
»
Towards Chemical Universal Turing Machines
»
On the Computational Power of Neural Nets
»
On the Complexity of Universal Programs
more »
Post Info
More Details (n/a)
Added
07 Jun 2010
Updated
07 Jun 2010
Type
Conference
Year
2007
Where
CIE
Authors
Damien Woods, Turlough Neary
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision