Betti numbers \(b_k(G)\) result in an uncomputable fast-growing function as proposed by Alexander Nabutovsky and Shmuel Weinberger.[1]
Let \(H_k(G)\) be the \(k\)-th homology group of a group \(G\). Given a finite presentation of a group \(G\), we define its length as the sum of the lengths of all its relators plus the number of generators. The \(k\)-th Betti number of a finitely presented group \(G\) is defined as \(b_k(G) = \text{rank }H_k(G)\) (using the torsion-free rank). Given a nonnegative integer \(N\), we define the Betti number \(b_k(N)\) as the maximal finite \(b_k(G)\) where \(G\) is a finitely presented group with length at most \(N\).
Sources
See also
Large numbers in computers
Main article: Numbers in computer arithmetic
127 · 128 · 256 · 32767 · 32768 · 65536 · 2147483647 · 4294967296 · 9007199254740991 · 9223372036854775807 · FRACTRAN catalogue numbersBignum Bakeoff contestants: pete-3.c · pete-9.c · pete-8.c · harper.c · ioannis.c · chan-2.c · chan-3.c · pete-4.c · chan.c · pete-5.c · pete-6.c · pete-7.c · marxen.c · loader.c
Channel systems: lossy channel system · priority channel system
Concepts: Recursion