OK. So we’ve got “Language … can be decomposed into … a mathematical expression.”
What is that mathematical expression?
I say it can’t.
I say language (“natural” human language, to distinguish it from computer or artificial languages) cannot be completely described any more compactly than a full body of its usage (that’s what distinguishes natural language from computer language or mathematical languages, and what has prevented us from building effective AI models of it up to now.)
You may say that mathematical expression exists, it has just not been found yet.
Then @DanML posted a book supporting something, but resolving to me, as supportive of what I was saying:
Over and over in this thread I’m repeating, with evidence (actual contradictions in language structure, and the size of language models, to name two) that natural language structure cannot be (completely and consistently) abstracted. But people just keep repeating that they are “sure” it is possible. It’s kind of amusing. But repetition as a public service also gets tiring.
To avoid repeating myself you should direct your arguments to what I wrote e.g. in this thread. Firstly evidence from the size of transformer models:
Maybe this post, #4 in this thread, gives the most comprehensive collection of arguments I’ve presented here on it: