About: Finite promise games   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : dbkwik.org associated with source dataset(s)

Finite promise games are a family of four closely related two-player games defined by Harvey Friedman. From three of these games arise some fast-growing functions that eventually dominate all recursive functions provably total in an extension of ZFC known as SMAH, but are provably total in a stronger theory known as SMAH+.

AttributesValues
rdfs:label
  • Finite promise games
rdfs:comment
  • Finite promise games are a family of four closely related two-player games defined by Harvey Friedman. From three of these games arise some fast-growing functions that eventually dominate all recursive functions provably total in an extension of ZFC known as SMAH, but are provably total in a stronger theory known as SMAH+.
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
abstract
  • Finite promise games are a family of four closely related two-player games defined by Harvey Friedman. From three of these games arise some fast-growing functions that eventually dominate all recursive functions provably total in an extension of ZFC known as SMAH, but are provably total in a stronger theory known as SMAH+.
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] Valid XHTML + RDFa
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