Computatibility and Chaos

Article View: comp.theory

Article #1704

#1704

From: Raj Patil
Date: Fri, 01 Jan 1993 09:44

9 lines
587 bytes

Does anyone know of any work done in the area of Chaos and Cumputability.
My basic question is: Is Chaos more powerful then Turing Machine. Now here 
i am assuming that the real Chaos (infinite precision) is not computed
using a TM.

Regards

Raj Patil

Technical Details

Message-ID: <RPATIL.93Jan1024423@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: comp.theory
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!umn.edu!lynx!nmsu.edu!opus!rpatil
From: rpatil@nmsu.edu (Raj Patil)
Subject: Computatibility and Chaos
Message-ID: <RPATIL.93Jan1024423@pylos.nmsu.edu>
Sender: usenet@nmsu.edu
Organization: Computing Research Lab
Date: Fri, 1 Jan 1993 09:44:23 GMT
Lines: 9