Yes, infinite computing power with current methodologies will never work. The article mentions that the number of possible sentences is of the order 10^570 and

Yes, infinite computing power with current methodologies will never work. The article mentions that the number of possible sentences is of the order 10^570 and current methods attempt to crack that (or sub) solution domains (primarily) using probabilities of association. This method will never work, except on small sub-domains (e.g. numbers or medical field transcription) as the article mentioned. However, if P=NP then there are better algorithms that can solve the problem. Does P=NP? Nobody knows but to me it seems to be true because when anyone interprets speech they definitely are not searching a 10^570 domain to solve the problem.