OpenLink Software

Usage stats on Transcendental integer

 Permalink

an Entity in Data Space: 134.155.108.49:8890

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.

Graph IRICount
http://dbkwik.webdatacommons.org7
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Copyright © 2009-2012 OpenLink Software