The Reachability of Computer Programs
It addresses a foundational problem in computer science about understanding algorithmic discovery, but appears incremental as it is a first effort in this specific viewpoint.
This study tackles the problem of explaining the emergence of new computational ideas using computation itself, by defining program reachability as a probability function based on algorithmic entropy.
Would it be possible to explain the emergence of new computational ideas using the computation itself? Would it be feasible to describe the discovery process of new algorithmic solutions using only mathematics? This study is the first effort to analyze the nature of such inquiry from the viewpoint of effort to find a new algorithmic solution to a given problem. We define program reachability as a probability function whose argument is a form of the energetic cost (algorithmic entropy) of the problem.