Complexity Reference: compref302 (BibTex)

Authors: Siegelmann,HT

Year: 1995

Title: Computation Beyond the turing Limit

Journal: Science, 268, 545-548

Comments: Shows that a cerain class of analogue computing devices go beyond the capabilities of a Turing Machine, and that a certain variation of this is "realisable".

Keywords: NETWORK, CHAOS, COMPUTABILITY,

| Top | Authors | Journals | Years | Keywords | Search | New | Comments |


Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University