Chaos and Computability

Article View: sci.fractals

Article #288

#288

From: Raj Patil
Date: Fri, 01 Jan 1993 10:16

20 lines
1166 bytes

Is Chaos more powerful in the Computability sence then Turing Machine. In 
other words: A *real* Chaos (not the discrete version) behavior can be 
represented using a finite description which can generate  a Language that 
is not generated by the other finite representations we currently have. (reg.
exp, CFG, TM etc). I should be actually talking about decidibility of a 
Language rather then its generation. But as i know a little bit about Chaos
is it not possible to find the starting point and the curve given the 
Language. I am refering a Language to a Fractal.

Based on this idea of Machines and Languages, is Chaos more powerful then
and Turing Machine? and is *real* Chaos Comuputable by Turing Machine?

Any ideas..

Regards

Raj Patil
New Mexico State Univ.
Las Cruces, NM 88003

Technical Details

Message-ID: <RPATIL.93Jan1031622@pylos.nmsu.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!umn.edu!lynx!nmsu.edu!opus!rpatil

Show Full Headers

Complete Article Headers

Newsgroups: sci.fractals
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!umn.edu!lynx!nmsu.edu!opus!rpatil
From: rpatil@nmsu.edu (Raj Patil)
Subject: Chaos and Computability
Message-ID: <RPATIL.93Jan1031622@pylos.nmsu.edu>
Sender: usenet@nmsu.edu
Organization: Computing Research Lab
Distribution: sci.fractals
Date: Fri, 1 Jan 1993 10:16:22 GMT
Lines: 20