Name
Abstract | ||
|---|---|---|
In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation. She also established the equivalence between the ARNN and other analog systems that support hypercomputation, launching the foundations of an alternative computational theory. In this paper we contribute to this alternative theory by exploring the use of formal methods in the verification of temporal properties of ARNNs. Based on the work of Bradfield in verification of temporal properties of infinite systems, we simplify his tableau system, keeping its expressive power, and show that it is suitable to the verification of temporal properties of ARNNs. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-45720-8_19 | IWANN (1) |
Keywords | Field | DocType |
hava siegelmann,formal method,artificial recurrent neural network,neural networks,new computational model,support hypercomputation,temporal property,verifying properties,expressive power,alternative computational theory,alternative theory,analog system,neural network,computer model,recurrent neural network,computability theory | Hypercomputation,Computer science,Recurrent neural network,Theoretical computer science,Equivalence (measure theory),Artificial intelligence,Formal methods,Temporal logic,Artificial neural network,Machine learning,Formal verification,Theory of computation | Conference |
ISBN | Citations | PageRank |
3-540-42235-8 | 4 | 0.39 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro Rodrigues | 1 | 4 | 0.39 |
| José Félix Costa | 2 | 336 | 37.00 |
| Hava T. Siegelmann | 3 | 980 | 145.09 |