Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025
Hey Pentti, We Did It Again!: Differentiable vector-symbolic types that prove polynomial termination
Eilene Tomkins-Flanagan, Connor Hanley, Mary A. Kelly
We present a typed computer language, Doug, in which all typed programs may be proved to halt in polynomial time, encoded in a vector-symbolic architecture (VSA). Doug is just an e…
cs.AI2024
Bridging Generative Networks with the Common Model of Cognition
Robert L. West, Spencer Eckler, Brendan Conway-Smith +3
This article presents a theoretical framework for adapting the Common Model of Cognition to large generative network models within the field of artificial intelligence. This can be…