Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

BSL
2005

favoriteEmaildiscussreport

74views more BSL 2005»

Turing computations on ordinals

13 years 4 months ago

Turing computations on ordinals

Download www.math.uni-bonn.de

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of G

Peter Koepke

Real-time Traffic

Arbitrary Ordinal Length | BSL 2005 | Ordinal Computability | Standard Turing Computability |

claim paper

Related Content

» Computing a Model of Set Theory

» Posts Problem for Ordinal Register Machines

» The Transfinite Action of 1 Tape Turing Machines

» Ordinal Computability

» Register computations on ordinals

» The Computational Complexity of Weak Saddles

» Measuring Agent Intelligence via Hierarchies of Environments

» An Enhanced Theory of Infinite Time Register Machines

» On the time complexity of 2tag systems and small universal Turing machines

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	BSL
Authors	Peter Koepke

Comments (0)