The Complexity of Proving Chaoticity and the Church-Turing Thesis

Details The Complexity of Proving Chaoticity and the Church-Turing Thesis The Complexity of Proving Chaoticity and the Church-Turing Thesis

2010-06-15

arxiv.org/abs/1006.2951v2

Chaos: An Interdisciplinary Journal of Nonlinear Science 20(3), 037103 (2010)

Nonlinear Sciences

Chaotic Dynamics

13 pages, new proof of the main theorem

Scientific paper

10.1063/1.3489096

Proving the chaoticity of some dynamical systems is equivalent to solving the
hardest problems in mathematics. Conversely, one argues that it is not
unconceivable that classical physical systems may "compute the hard or even the
incomputable" by measuring observables which correspond to computationally hard
or even incomputable problems.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Proving Chaoticity and the Church-Turing Thesis 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 The Complexity of Proving Chaoticity and the Church-Turing Thesis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Proving Chaoticity and the Church-Turing Thesis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104937