About: Knuth Arrow Theorem   Sponge Permalink

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

The Knuth Arrow Theorem is a theorem proven by Sbiis Saibian. It states that for any integers a≥2, b≥1, c≥1, x≥2, using up-arrow notation, (a↑xb)↑xc < a↑x(b+c). The theorem is useful for comparing values in up-arrow notation. For example, it can be used to prove that giggol (10↑↑100) is smaller than tritri (3↑↑↑3 = 3↑↑7,625,597,484,987): 10↑↑100 < 27↑↑100 = (3↑↑2)↑↑100 < 3↑↑102 << 3↑↑7,625,597,484,987 = tritri

AttributesValues
rdfs:label
  • Knuth Arrow Theorem
rdfs:comment
  • The Knuth Arrow Theorem is a theorem proven by Sbiis Saibian. It states that for any integers a≥2, b≥1, c≥1, x≥2, using up-arrow notation, (a↑xb)↑xc < a↑x(b+c). The theorem is useful for comparing values in up-arrow notation. For example, it can be used to prove that giggol (10↑↑100) is smaller than tritri (3↑↑↑3 = 3↑↑7,625,597,484,987): 10↑↑100 < 27↑↑100 = (3↑↑2)↑↑100 < 3↑↑102 << 3↑↑7,625,597,484,987 = tritri
dcterms:subject
abstract
  • The Knuth Arrow Theorem is a theorem proven by Sbiis Saibian. It states that for any integers a≥2, b≥1, c≥1, x≥2, using up-arrow notation, (a↑xb)↑xc < a↑x(b+c). The theorem is useful for comparing values in up-arrow notation. For example, it can be used to prove that giggol (10↑↑100) is smaller than tritri (3↑↑↑3 = 3↑↑7,625,597,484,987): 10↑↑100 < 27↑↑100 = (3↑↑2)↑↑100 < 3↑↑102 << 3↑↑7,625,597,484,987 = tritri
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