Шешілмейтіндік
otherentity
ID: undecidability
Related Papers
OT Syntax – Decidability of Generation-based Optimization
In Optimality-Theoretic Syntax, optimiza- tion with unrestricted expressive power on the side of the OT constraints is unde- cidable. This paper provides a proof for the decidability of optimization based …...
Recurrent Neural Networks as Weighted Language Recognizers
AbstractWe investigate the computational complexity of various problems for simple recurrent neural networks (RNNs) as formal models for recognizing weighted languages. We focus on the single-layer, ReLU-activation, rational-weight RNNs with …...