Also it's not quite clear what the array types you are suggesting would be doing exactly, and why they would need to be builtin instead of being provided by a library.
Can you provide a paper? By the way, O(n) sort is already achieved using radix and counting sort, but in practice, they are not viable for sufficiently small arrays.
Also, things like counting sort, pigeonhole sort, and bubble sort exist that provide O(n) integer sorting and those could be used to build fully constant-time integer priority queues, though this doesn't necessarily specify any particular algorithm (only a blueprint for various algorithms).
The immediate proposal here is confusing this with neural networks, though, and really needs to go back to the drawing board and take into better account existing algorithms and how they might be implemented. Also, I'm not sure why they're suggesting this be incorporated into the core language when I don't even see libraries being cited here (or cases where the language legitimately doesn't provide the facilities necessary to implement it).