Re:PhD student solves 2,500-year-old Sanskrit problem
by asaph on Thursday December 15, 2022 @09:06AM
(#33999642)
What’s the threshold of special cases allowed where the problem is considered solved?
Re:PhD student solves 2,500-year-old Sanskrit problem
by chmod775 on Thursday December 15, 2022 @09:44AM
(#34000236)
The second sentence in the comment you're replying to already answers your question.
If that is not good enough, I suspect that no possible answer would prove to be satisfactory.
Re:PhD student solves 2,500-year-old Sanskrit problem
by asaph on Thursday December 15, 2022 @09:49AM
(#34000333)
“Almost” and “easily” are subjective and open to interpretation. My point is, that this is not a rigorous standard.
Re:PhD student solves 2,500-year-old Sanskrit problem
by chmod775 on Thursday December 15, 2022 @10:06AM
(#34000608)
Languages are generally not very amenable to these things.
If you want to construct the entire field of linguistics mathematically that would certainly be interesting to watch. Since a function that is described by a simple equation is mathematically equivalent to a function that is described by a table assigning the appropriate values to each element of the function domain, you could try to come up with a definition for what constitutes the "optimal" way to describe a function. Do the same for any kind of relation.
Until you've done so linguists will sadly be stuck applying nothing more than common sense.
Re:PhD student solves 2,500-year-old Sanskrit problem
by MockObject on Thursday December 15, 2022 @11:13AM
(#34001688)
Just a few.
Re:PhD student solves 2,500-year-old Sanskrit problem
by bigbillheck on Thursday December 15, 2022 @11:50AM
(#34002259)
Buddy, I'm speaking English, it's full of exceptions.
But almost means one can easily list the remaining special cases.