Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
General Decidability Results for Systems with Continuous Counters
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar +2
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs.…
cs.FL2025
Softmax Transformers are Turing-Complete
Hongjian Jiang, Michael Hahn, Georg Zetzsche +1
Hard attention Chain-of-Thought (CoT) transformers are known to be Turing-complete. However, it is an open problem whether softmax attention Chain-of-Thought (CoT) transformers are…