Computer Science – Computational Complexity
Scientific paper
2006-04-05
Computer Science
Computational Complexity
Scientific paper
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.
Dhar M. O.
Habibi O.
Patihnedj U. R.
No associations
LandOfFree
Towards Analog Reverse Time Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Towards Analog Reverse Time Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Analog Reverse Time Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-721098