Bird's Proof is a theorem by Chris Bird that states that: \[\forall a \geq 3, b \geq 2, c \geq 1, d \geq 2: \{a, b, c, d\} > \underbrace{a ightarrow a ightarrow \ldots ightarrow a ightarrow a}_d ightarrow (b - 1) ightarrow (c + 1)\] using array notation and chained arrow notation. In other words, four entries of array notation are comparable to chained arrow notation, but five entries far surpass it. It was published in his paper "Array Notations for Super Huge Numbers", and was named by Jonathan Bowers on his website.
Attributes | Values |
---|
rdfs:label
| |
rdfs:comment
| - Bird's Proof is a theorem by Chris Bird that states that: \[\forall a \geq 3, b \geq 2, c \geq 1, d \geq 2: \{a, b, c, d\} > \underbrace{a ightarrow a ightarrow \ldots ightarrow a ightarrow a}_d ightarrow (b - 1) ightarrow (c + 1)\] using array notation and chained arrow notation. In other words, four entries of array notation are comparable to chained arrow notation, but five entries far surpass it. It was published in his paper "Array Notations for Super Huge Numbers", and was named by Jonathan Bowers on his website.
|
dcterms:subject
| |
abstract
| - Bird's Proof is a theorem by Chris Bird that states that: \[\forall a \geq 3, b \geq 2, c \geq 1, d \geq 2: \{a, b, c, d\} > \underbrace{a ightarrow a ightarrow \ldots ightarrow a ightarrow a}_d ightarrow (b - 1) ightarrow (c + 1)\] using array notation and chained arrow notation. In other words, four entries of array notation are comparable to chained arrow notation, but five entries far surpass it. It was published in his paper "Array Notations for Super Huge Numbers", and was named by Jonathan Bowers on his website.
|