A provably stable neural network Turing machine with finite precision and time

DOI10.1016/j.ins.2023.120034MaRDI QIDQ6193467

Ankur Mali, C. Lee Giles, John Stogin

Publication date: 13 February 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

stabilityautomatauniversal Turing machineChomsky hierarchyTuring completenessfinite precisionformal language theoryneural stackneural tapetensor RNNs

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides
• Analog computation via neural networks
• On the computational power of neural nets
• Efficient simulation of finite automata by neural nets
• Constructing deterministic finite-state automata in recurrent neural networks
• On Two Classical Theorems of Algebraic Topology
• Language identification in the limit
• Four Small Universal Turing Machines
• Noisy time series prediction using recurrent neural networks and grammatical inference
• Quantum artificial neural network architectures and components
• Simulations of quantum neural networks

This page was built for publication: A provably stable neural network Turing machine with finite precision and time