Abstract:
The recent work on automata whose variables and parameters are real numbers (e.g., Blum, Shub, and Smale, 1989; Koiran, 1993; Bournez and Cosnard, 1996; Siegelmann, 1996; Moore, 1996) has focused largely on questions about computational complexity and tractability. It is also revealing to examine the metric relations that such systems induce on automata via the natural metrics on their parameter spaces. This brings the theory of computational classification closer to theories of learning and statistical modeling which depend on measuring distances between models. With this in mind, I develop a generalized method of identifying pushdown automata in one class of real-valued automata. I then explore the metric organization of these automata in a basic example, showing how it fleshes out the skeletal structure of the Chomsky Hierarchy and indicates a new approach to the problem of complex grammar learning. 1
Citations
|
2771
|
Introduction to Automata Theory, Languages and Computation
– Hopcroft, Ullman
- 1979
|
|
450
|
Fractals Everywhere
– Barnsley
- 1988
|
|
303
|
On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
– Blum, Shub, et al.
- 1989
|
|
193
|
The induction of dynamical recognizers
– Pollack
- 1991
|
|
138
|
Nonlinear Dynamics and Chaos
– Strogatz
- 1994
|
|
72
|
Computation at the onset of chaos
– Crutchfield, Young
- 1990
|
|
63
|
Recursion theory on the reals and continuous-time computation
– Moore
- 1996
|
|
54
|
The calculi of emergence: Computation, dynamics, and induction
– Crutchfield
- 1994
|
|
47
|
Turing computability with neural nets
– Siegelmann, Sontag
|
|
45
|
Dynamical recognizers: Real-time language recognition by analog computers
– Moore
- 1998
|
|
30
|
Analysis of dynamical recognizers
– Blair, Pollack
- 1997
|
|
29
|
Computing over the reals with addition and order
– Koiran
- 1994
|
|
28
|
A weak version of the Blum, Shub & Smale model
– KOIRAN
- 1993
|
|
24
|
A Theory of Grammatical Induction in the Connectionist Paradigm
– Kremer
- 1996
|
|
20
|
On the computational power of dynamical systems and hybrid systems
– Bournez, Cosnard
- 1996
|
|
11
|
The simple dynamics of super Turing theories
– Siegelmann
- 1996
|
|
11
|
Landscapes in recurrent networks
– Wiles, Elman
- 1995
|
|
3
|
Representing the structure of a simple context-free language in a recurrent neural network: A dynamical systems approach
– Rodriguez
- 1995
|
