About: Mythical tree problem   Sponge Permalink

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

The mythical tree problem is a combinatorial problem created by Harvey Friedman. In the problem, the tree has a strange growth pattern. In the first stage, the tree grows k branches, forming k treetops. In the next stage, one of the treetops forms k+1 branches, increasing the number of treetops. The problem asks: what is the maximum number of branch segments a tree starting at k branches grow at once, during the tree's final stage of growth, provided that a squirrel can go from the root to any treetop without navigating more than four branch segments? Friedman has shown that:

AttributesValues
rdfs:label
  • Mythical tree problem
rdfs:comment
  • The mythical tree problem is a combinatorial problem created by Harvey Friedman. In the problem, the tree has a strange growth pattern. In the first stage, the tree grows k branches, forming k treetops. In the next stage, one of the treetops forms k+1 branches, increasing the number of treetops. The problem asks: what is the maximum number of branch segments a tree starting at k branches grow at once, during the tree's final stage of growth, provided that a squirrel can go from the root to any treetop without navigating more than four branch segments? Friedman has shown that:
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
abstract
  • The mythical tree problem is a combinatorial problem created by Harvey Friedman. In the problem, the tree has a strange growth pattern. In the first stage, the tree grows k branches, forming k treetops. In the next stage, one of the treetops forms k+1 branches, increasing the number of treetops. The problem asks: what is the maximum number of branch segments a tree starting at k branches grow at once, during the tree's final stage of growth, provided that a squirrel can go from the root to any treetop without navigating more than four branch segments? Friedman has shown that: * k = 2 corresponds to 21,990,232,555,518 segments * k = 3 corresponds to a value > 2295 * k = 4 corresponds to a value > 2 ↑↑ 2295 * The growth rate of the number of segments as a function of k can be generalized to be similar to that of the Ackermann function.
is wikipage disambiguates of
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