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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
89
Voted
CIE
2006
Springer
70
views
Applied Computing
»
more
CIE 2006
»
Infinite Time Register Machines
15 years 6 months ago
Download
www.math.uni-bonn.de
Peter Koepke
Real-time Traffic
Applied Computing
|
CIE 2006
|
claim paper
Related Content
»
An Enhanced Theory of Infinite Time Register Machines
»
The basic theory of infinite time register machines
»
Infinite Time Cellular Automata A Real Computation Model
»
Posts Problem for Ordinal Register Machines
»
Ordinal Computability
»
Subcubic algorithms for recursive state machines
»
A generalized algorithm for graphcoloring register allocation
»
Deterministic Turing Machines in the Range between RealTime and LinearTime
»
Register File Design Considerations in Dynamically Scheduled Processors
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2006
Where
CIE
Authors
Peter Koepke
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision