The Reachability of Computer Programs

08/23/2017
by   Reginaldo I. Silva Filho, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2022

On Higher-Order Reachability Games vs May Reachability

We consider the reachability problem for higher-order functional program...
research
07/28/2020

Inductive Reachability Witnesses

In this work, we consider the fundamental problem of reachability analys...
research
07/20/2020

The Decidability of Verification under Promising 2.0

In PLDI'20, Lee et al. introduced the promising semantics PS 2.0 of the...
research
05/25/2020

Verification of the IBOS Browser Security Properties in Reachability Logic

This paper presents a rewriting logic specification of the Illinois Brow...
research
07/03/2012

Axiomatic Tools versus Constructive approach to Unconventional Algorithms

In this paper, we analyze axiomatic issues of unconventional computation...
research
07/14/2020

The Collatz process embeds a base conversion algorithm

The Collatz process is defined on natural numbers by iterating the map T...
research
11/06/2017

Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability

Previously referred to as 'miraculous' because of its surprisingly power...

Please sign up or login with your details

Forgot password? Click here to reset