3 ms·
> A rigorous langauge is one which can be defined completely in a single document starting with 0 and 1 and working it's way all the way up to whatever it is yo
by panic 7y ago
> A rigorous langauge is one which can be defined completely in a single document starting with 0 and 1 and working it's way all the way up to whatever it is you want to prove.
Is there a document like this for your tree notation? Not trying to criticize; I'm legitimately interested to see how this would be done.
- breck 7y ago> Is there a document like this for your tree notation? I wish. We have a lot of ongoing threads about it. Someone has one somewhere for logic gates, IIRC. Here's a snippet from 1 from a conversation the other day on how to build up to an if statement. 0 1 2 10 ... i 01101001 ... f 01100110 ... if 1 2 Obviously that's not ideal but hopefully some more data on what we are talking about with that. The idea is we'd like to be able to compare 2 systems objectively and decide which is the simpler one. Here's a rough paper from 2017 (before I had any experience in academia): https://github.com/treenotation/jtree/blob/master/papers/paper3/countingComplexity.pdf https://github.com/treenotation/jtree/blob/master/papers/pap...