Didn’t you go into Turing machines and the Halting problem from that?
That was my intro into computation: regex, automatas, state machines, stack state machines, formal languages, grammars, Turing machines, Hanting Problem, P NP.
- 0 Posts
- 2 Comments
Joined 1 year ago
Cake day: June 1st, 2023
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
A tree can be seen as a formal language. Look into L-systems.
If you generalize what a symbol is (the rgb value of a pixel) you can write a grammar that ends producing a list of pixels. You can then place it in a 2d matrix and you have an image.
I guess a better approach would be wave function colapse, but seems to me like it could be formally described as a grammar (CS or CF, dunno, would have to look into it)