Results 21 to 30 of about 540 (53)

Transformers Learn Shortcuts to Automata

open access: yes, 2023
Algorithmic reasoning requires capabilities which are most naturally understood through recurrent models of computation, like the Turing machine. However, Transformer models, while lacking recurrence, are able to perform such reasoning using far fewer ...
Ash, Jordan T.   +4 more
core  

Preliminares al estudio de la huella en lingüística [PDF]

open access: yes, 2020
The present paper constitutes a brief advance of much longer and more detailed ongoing work on the concept of “trace” in contemporary linguistic theory, particularly in syntax. It is commonly believed that the idea was coined by Noam Chomsky. However, we
Arias Navarro, Javier
core   +1 more source

Exposing Attention Glitches with Flip-Flop Language Modeling

open access: yes, 2023
Why do large language models sometimes output factual inaccuracies and exhibit erroneous reasoning? The brittleness of these models, particularly when executing long chains of reasoning, currently seems to be an inevitable price to pay for their advanced
Ash, Jordan T.   +4 more
core  

Preliminares al estudio de la huella en lingüística [PDF]

open access: yes, 2019
The present paper constitutes a brief advance of much longer and more detailed ongoing work on the concept of “trace” in contemporary linguistic theory, particularly in syntax. It is commonly believed that the idea was coined by Noam Chomsky. However, we
Arias, Javier
core   +1 more source

{NoPE}: The Counting Power of Transformers with No Positional Encodings [PDF]

open access: yes
Positional Encodings (PEs) seem to be indispensable for ensuring expressiveness of transformers; without them attention transformers reduce to a bag-of-word model. NoPE-transformers (i.e.
Kozachinskiy, A.   +4 more
core   +2 more sources

Two characterisation results of multiple context-free grammars and their application to parsing [PDF]

open access: yes, 2020
In the first part of this thesis, a Chomsky-Schützenberger characterisation and an automaton characterisation of multiple context-free grammars are proved. Furthermore, a framework for approximation of automata with storage is described.
Denkinger, Tobias
core   +1 more source

Mathematical linguistics [PDF]

open access: yes, 2007
but in fact this is still an early draft, version 0.56, August 1 2001.
Kornai, András
core   +2 more sources

A primordial, mathematical, logical and computable, demonstration (proof) of the family of conjectures known as Goldbach´s [PDF]

open access: yes, 2017
licencia de Creative Commons Reconocimiento-NoComercial-SinObraDerivada 4.0 Internacional.In this document, by means of a novel system model and first order topological, algebraic and geometrical free-­‐context formal language (NT ...
Noheda Marín, Pedro   +1 more
core  

Impact of Membrane Computing and P Systems in ISI WoS. Celebrating the 65th Birthday of Gheorghe Păun [PDF]

open access: yes, 2015
Membrane Computing is a branch of Computer Science initiated by Gheorghe Păun in 1998, in a technical report of Turku Centre for Computer Science published as a journal paper ("Computing with Membranes" in Journal of Computer and System Sciences) in 2000.
Dzitac, Ioan
core   +1 more source

Home - About - Disclaimer - Privacy