Common
Friedman's SSCG function
Fast-growing function
Friedman's SSCG function
Friedman's SSCG function is a mathematical function defined by Harvey Friedman. It is defined by SSCG ( k ) {\displaystyle {\text{SSCG}}(k)} as the largest integer n {\displaystyle n} satisfying the following: There is a sequence G 1 , … , G n {\displaystyle G_{1},\ldots ,G_{n}} of simple subcubic graphs such that each G i {\displaystyle G_{i}} has at most i + k {\displaystyle i+k} vertices and for no i < j {\displaystyle i<j} is...
Open boosters, collect cards and trade them. Free to play.
Play for free