Towards Analog Reverse Time Computation

TL;DR

This paper explores the potential of analog reverse time computation by analyzing destabilization effects on a simulated analog computer, highlighting its advantages over traditional methods and proposing new computational capabilities.

Contribution

It introduces the concept of analog reverse time computation and demonstrates how destabilization processes can enable higher computational classes in analog systems.

Findings

Destabilization impacts on simulated analog computers analyzed.

Analog bias can encode complex algorithms beyond polynomial.

Potential for higher computational classes via countermeasures of stochastic degeneracy.

Abstract

We report the consequences of a destabilization process on a simulated General Purpose Analog Computer. This new technology overcomes problems linked with serial ambiguity, and provides an analog bias to encode algorithms whose complexity is over polynomial. We also implicitly demonstrate how countermesures of the Stochastic Aperture Degeneracy could efficiently reach higher computational classes, and would open a road towards Analog Reverse Time Computation.