Work

The Reachability of Computer Programs

Year: 2017

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1708.06877

Authors: Filho, Reginaldo I. Silva, da Rocha, Ricardo L. Azevedo, Silva, Camila Leite, Guiraldelli, Ricardo H. Gracini

Institutions: Universidade de São Paulo, Universidade Federal de Mato Grosso do Sul

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4297825197

Cites:

Cited by:

Related to: 10