The number 1093, called Bremermann's limit, is, according to Hans-Joachim Bremermann, the total number of bits processed by a hypothetical computer the size of the Earth within a time period equal to the estimated age of the Earth.
[3] Exhaustively testing all combinations of an integrated circuit with 309 boolean inputs and 1 output requires testing of a total of 2309 combinations of inputs.
This means that there is no way one can verify the correctness of the circuit for all combinations of inputs through brute force alone.
To analyze such a system, a minimum of kn bits of information are to be processed.
This happens for the following values of k and n:[1] The existence of real-world transcomputational problems implies the limitations of computers as data processing tools.