About: Infinite time Turing machine

Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Infinite time Turing machine Sponge Permalink

An Entity of Type : dbkwik:resource/4aznwUI91u-_lcyx_rD8kQ==, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Infinite time Turing machines (ITTMs) are a generalization of Turing machines to infinite computation lengths, first described by Joel David Hamkins and Andy Lewis. They lead to a stronger analog \(\Sigma_\infty\) to the busy beaver function.

Attributes	Values
rdf:type	function
rdfs:label	Infinite time Turing machine
rdfs:comment	Infinite time Turing machines (ITTMs) are a generalization of Turing machines to infinite computation lengths, first described by Joel David Hamkins and Andy Lewis. They lead to a stronger analog \(\Sigma_\infty\) to the busy beaver function.
dcterms:subject	Transfinite ordinals Uncomputable
dbkwik:googology/p...iPageUsesTemplate	dbkwik:resource/6jJxc72T8ljy4GoTDBvHyA== dbkwik:resource/5T7U0GCiFhQm745tgUytXQ== dbkwik:resource/4Yinzn8rermcG1agWBAwNw== dbkwik:resource/yT3JrwLDjx1EXiHBG5CO8g==
Name	ITTM busy beaver
Author	Jamie Long and Lee J. Stanley
Year	1998(xsd:integer)
notation	\
growthrate	>* all ITTM-computable functions
abstract	Infinite time Turing machines (ITTMs) are a generalization of Turing machines to infinite computation lengths, first described by Joel David Hamkins and Andy Lewis. They lead to a stronger analog \(\Sigma_\infty\) to the busy beaver function.

OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software