-
Hello! I hope this finds you well!
I find this language you've implemented to be quite interesting, especially after seeing it implement a Turing machine in an animation on twitter. I've seen it de…
-
Consider an algorithm that takes as input a 0-1 sequence of exactly five symbols, and returns a *1* if the sequence contains at least three **consecutive** *1*s, and returns a *0* otherwise. Implement…
-
- [x] Make sure that card, badge and landing pages all point to the same landing pages (shared function?)
- [x] Delete commented-out code
- [x] Delete requirements.txt (actually, I reduced it to 6 l…
-
**This is a(n):**
- [x] New algorithm
- [ ] Update to an existing algorithm
- [ ] Error
- [x] Proposal to the Repository
**Details:**
I want to add a module on theoretical computer…
-
## Summary
A BinderHub isn't the most useful platform for a research community - it generally lacks persistence (although you can rectify this by deploying the [persistent_binderhub helm chart](htt…
-
Consider an algorithm that takes as input a 0-1 sequence of exactly five symbols, and returns a *1* if the sequence contains at least three **consecutive** *1*s, and returns a *0* otherwise. Implement…
-
Consider an algorithm that takes as input a 0-1 sequence of exactly five symbols, and returns a *1* if the sequence contains at least three *1*s **in any order**, and returns a *0* otherwise. Implemen…
-
Consider an algorithm that takes as input a 0-1 sequence of exactly five symbols, and returns a 1 if the sequence contains at least three **consecutive** _1s_, and returns a 0 otherwise. Implement the…
-
I'm glad you like the Meson build system, but this is not really a "proof" of Turing completeness. The mathematical definition of Turing completeness is very specific. It is not "takes a very, very, v…
-
In #975 I describe the notion that OrbitDB stores should not be seen as equivalents to an SQL table and much rather as an individual row or document in an SQL or NoSQL database respectively.
Here I…