Oh boy, another new language!
A tensor language prototype for high-performance computers: https://techxplore.com/news/2022-02-tensor-language-prototype-high-performance.html
On 22/02/16 4:52 PM, Gary Scott wrote:
Oh boy, another new language!
A tensor language prototype for high-performance computers:
https://techxplore.com/news/2022-02-tensor-language-prototype-high-performance.html
Well.. it seems to have advantages over Java, the article says!
Jos Bergervoet <jos.ber...@xs4all.nl> schrieb:
On 22/02/16 4:52 PM, Gary Scott wrote:
Oh boy, another new language!
A tensor language prototype for high-performance computers:
https://techxplore.com/news/2022-02-tensor-language-prototype-high-performance.html
Well.. it seems to have advantages over Java, the article says!It is not 100% clear, but it seems they solved the halting problem...
# Coq had another intrinsic feature that made it attractive to the
# MIT-based group: programs written in it, or adaptations of it,
# always terminate and cannot run forever on endless loops (as can
# happen with programs written in Java, for example).
... by making their language Turing-incomplete, they must effectively
have banned loops.
Just think of it - no Newton iterations. You cannot even implement
an iterative sparse solver. Great!!!11!1!1!
Not necessarily. Just your Newton-iteration must have a number of iterations, after which it does give up if it has not yet converged. I usually program it like that in Fortran or C++ too.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 159 |
Nodes: | 16 (0 / 16) |
Uptime: | 99:52:24 |
Calls: | 3,209 |
Files: | 10,563 |
Messages: | 3,009,979 |