The Head Complexity of Boolean Functions in Single-Layer Attention
A compactness theorem shows that any function computable at all can be computed with embedding dimension and precision bounded by the discrete data of the task, namely, head count, alphabet size, and length.
R. Rajaraman, Ravi Sundaram, Amanuel Tesfaye
· 1 citation