About: Transcendental integer

Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Transcendental integer Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

The transcendental integers are a class of huge numbers, defined by Harvey Friedman. If \(n\) is an integer then we call it transcendental iff the following holds: let M be a Turing machine, such that there is proof in ZFC of length at most 21000 showing that M halts. Then M halts in at most \(n\) steps. In other words, \(n\) is greater than halting time of every Turing machine with ZFC proof of halting of length at most 21000.

Attributes	Values
rdfs:label	Transcendental integer
rdfs:comment	The transcendental integers are a class of huge numbers, defined by Harvey Friedman. If \(n\) is an integer then we call it transcendental iff the following holds: let M be a Turing machine, such that there is proof in ZFC of length at most 21000 showing that M halts. Then M halts in at most \(n\) steps. In other words, \(n\) is greater than halting time of every Turing machine with ZFC proof of halting of length at most 21000.
dcterms:subject	Numbers Classes Series
dbkwik:googology/p...iPageUsesTemplate	dbkwik:resource/7cBS1V3uWaVowycFZIqhOg==
abstract	The transcendental integers are a class of huge numbers, defined by Harvey Friedman. If \(n\) is an integer then we call it transcendental iff the following holds: let M be a Turing machine, such that there is proof in ZFC of length at most 21000 showing that M halts. Then M halts in at most \(n\) steps. In other words, \(n\) is greater than halting time of every Turing machine with ZFC proof of halting of length at most 21000.

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