-
> Clarity is a decidable language. A programming language is decidable if you can know, with certainty, from the code itself what the program will do.
I think this statement should be modified, as …
ghost updated
3 years ago
-
I think it will a GREAT thing.
ghost updated
5 years ago
-
* https://en.wikipedia.org/wiki/Smart_contract
* https://en.wikipedia.org/wiki/Ricardian_contract
other list of smart contract languages:
* https://www.dslfin.org/resources.html
* https://gith…
-
This is not really a bug report and I certainly don't want TypeScripts type system being restricted due to this issue. However, I noticed that the type system in its current form (version 2.2) is tur…
-
It is possible that `Turing.jl` already supports running submodels in parallel at least with some backends. It seems possible that if they don't now this functionality may be added if there is user de…
-
The current way pdf's are compiled is unsecure, as LaTeX is a turing complete language it is very easy to read all the files on the server file system. If flylatex used the clsi then this would be sol…
-
This language is a Ρ″ clone (also known as a brainfuck derivative), however, it is not currently Turing complete (or BSM) because the loop construct in your implementation is not sufficiently versatil…
-
Dear colleagues,
Given that there are quite a few people who have shown interest in attending to this workshop, we may not have time to properly introduce ourselves during the session. However, we…
-
### Summary
In the Research Community Managers team at the Turing ([learn more here!](https://github.com/alan-turing-institute/open-community-building)), we discussed how to evaluate events, and th…
-
Hi,
I added labels (:label) and 'get label address' (!label) and then wrote in chicken scheme an assembler compiles them into pure MNNBFSL:
https://gist.github.com/orchid-hybrid/29cd05db345d17f80de5…