Computabimus

Computabimus is a term used in discussions of computation and the philosophy of mathematics to symbolize the idea that computational description of phenomena is possible in principle. The name combines the Latin computare "to compute" with the first-person plural future form computabimus, literally "we shall compute." In scholarly usage, computabimus acts as a motto or thought-prompter rather than a formal theory; it signals a stance that, given enough time, resources, and clever algorithms, well-posed questions are solvable by computation.

The term is often discussed in relation to the Church–Turing thesis and debates about the limits of computation, including the existence of undecidable problems. Proponents of computabimus emphasize the distinction between theoretical computability and practical computability, as well as the possibility of future advances such as new models of computation or approximate methods that extend what is computable in practice, while critics point to proven limits like undecidability and resource bounds.

In practice, computabimus is rarely used as a technical label in formal literature; rather, it appears in pedagogy, philosophy of mind, and speculative writings as a concise way to frame the aspirational question of whether everything that can be defined algorithmically can eventually be computed.

Related topics include computability theory, Turing machines, decidability, and hypercomputation debates.