The Reachability of Computer Programs

2017/08/23 by Filho, Reginaldo I. Silva, da Rocha, Ricardo L. Azevedo, Silva, Camila Leite +1
#Artificial Intelligence (cs.AI) #E.4 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1708.06877

Abstract

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.

Related

• On the computational capabilities of physical systems part II: relationship with conventional computer science
• Two philosophical applications of algorithmic information theory
• Applying Practice to Theory
• From Philosophy to Program Size
• The Problem of Computational Complexity