Tech
Technology as a Search Problem
Publication: Construction Physics
Author: Brian Potter
Source published: 12/11/2026, 13:01:45 UTC
Briefing created: 12/11/2026, 13:13:40 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 12/11/2026, 13:11:24 UTC.
Briefings
The author proposes that technological progress functions as a search process within a vast design space, where inventors navigate possibilities by gathering information. Citing economist Matt Clancy, the text estimates the number of possible regularities in technology at 272, leading to a theoretical combination of 2^272, which exceeds the atom count of the observable universe. The author contrasts this with the Wright brothers' success, attributing it to their ability to gather information and narrow the search space using physical laws and bird existence proofs. The author also references a previous study by Arthur and Polak on logic circuit evolution, noting their interest in using simulation to explore technological dynamics.
Key points
- Technological progress is conceptualized as a search process within a high-dimensional design space where inventors navigate possibilities by gathering information.
- A rough estimate of 272 regularities in technology yields a theoretical combination of 2^272, exceeding the atom count of the observable universe (~10^80).
Context
The article explores technological progress as a search process, citing economist Matt Clancy's analysis of regularities in technology. It contrasts the vast theoretical search space with historical examples like the Wright brothers' success, highlighting the importance of information gathering in narrowing possibilities.
Limitations
The article relies on Clancy's estimate of 272 regularities and a previous simulation study by Arthur and Polak, which may not capture all technological possibilities. The author's own research on technological search dynamics remains incomplete, with ongoing work on a general model beyond logic circuits.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 12/11/2026, 13:13:40 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiezjgkxbex4zo5w66f3xkjbkkenjz5mbxsomtf4mcoxp2jjarolrq