The computability theory of group organizations is isomorphic to the Langlands program, and can be said to be the Langlands program in the field of computing. The core idea is: Using the self preserving function as its abstract structure, referring to Darwin's collective evolutionary thinking, constructing the world with dynamic collective evolutionary thinking. There are two sets of self preserving functions in BTC: One: Self preservation of UTXO account permissions and self preservation of inherited elliptic curves. Secondly, the self preservation of the longest chain architecture is a typical theoretical use case for computable group organizations. Self preservation is the core characteristic of decentralized adaptive complex systems. The Differences and Similarities between the Langlands Program and the Hilbert Formal Building: Similarities: Both aim to construct a comprehensive mathematical theory to unify the expression of the world. The purpose is the same. Differences: Different ways of thinking Hilbert wanted to construct using static, mechanized, and deterministic formalistic ideas, which were early debunked by self referential objects constructed by G ö del/Turing and others. The Langlands program is constructed using dynamic and uncertain evolutionary thinking, centered around the self preservation function as the fundamental unit of group evolution. Wiles proved Fermat's theorem (also known as the Tanisan Shimura conjecture) using this idea: the self preservation isomorphism of elliptic curves and modular operations. The Hilbert Formal Building is Cantor/Bourbaki's individual deterministic thinking: supporting the "black or white" principle of excluded middle law and the illusion of controlling infinity (i.e. supporting real infinity). The Langlands program, on the other hand, is based on the probabilistic intuitive constructivist thinking of Gauss, Kronecker, and Poincar é: the deterministic expression of "black or white" is only a special case of probability (corresponding to a probability of 0 or 100%) and only supports infinity that has already been specified as the limit process for generating it from a finite set (i.e. supports latent infinity but not real infinity).