using the finite state of a turing machine (or any computational model) as a finite memory is a common technique and it's definitely taught in courses. Congratz for figuring it out on your own!

can’t wait to play with your tula!

Tsoding, your videos are so cozy. You don't even know. When I am stressed at work I throw them on in the background to help me relax. not kidding.

you are my spirit animal. this is a master piece

I once played in a CTF where the challenge was to come up with substitutions for a markov algorithm to accomplish a given task. One of the most interesting challenges that I've completed. It was interesting to figure out how to "move" information around on the tape with just substitutions.

best streams for passing summer boredom.

Since LR parsers are essentially turing machines (or even comunication protocols), I wonder if tula can have real applications. Or, maybe, it's really just a turing tarpit.

Hello, Tsoding. I don't know how do you relate to suggestions, but could you spend a pair of streams tinkering with open-sourced Dagor engine? This might be interesting because of fully realtime lighting, built-in bunch of shaders (like volumetric clouds) and many other stuff.

I don't know if the problem is in my side but the video sometimes lags a lot, off course it doesn't mess with the understanding of the content but is kind annoying. Maybe it's twitch losing some frames when converting the video or something like this. I also would llike to ask if you plan to share the twitch live stream also here on youtube, since you don't have any attachment with twitch will be kind cool to see you live here on this platform. Thanks for another amazing stream as usual!

Table of regexes Turing complete? I dunnoo.. did he literally invent perl?

[13:32] as a Spanish speaker (Mexican specifically), i've heard about Chilean dialect using "tula" to refer to the d(ick) machine, so i'd like to say huge thanks to Chile for being the best country of Chile (legit) and bringing such a perfect word to the world. Now, i did some research and don't ask me why i just did it. Some people say that "tula" is derived from the english word "tool", and another people say (according to my investigation) that Chile is "classist" because high-born people (or the rich millionaries ones) like to make themselves different from the low people (or poor ones), so poor people shifts the "ch" (as in Chile) to "sh" (saying "Shile" instead), rich people joins a "T" sound when they make the "ch" sound, so they say "Tchile" again, because they wanna be "different". Supposedly, a common word is "Pichula" to refer to the d(ick)-machine too, but that word followed that circle, "Pichula" transformed into "Chula", the "tch" thing changes to "Tchula", "tch" got dropped to "t" so it is "tula" now. That kind of speaking like "tula" "pichula" and so falls into the "Flaite" way of speaking, Chilean people often says that they're ashamed of that way of speaking because "Flaite" people it's related to drugs and crime life. In the spanish speaking community (Spain and Latin America) all coincide in the Chilean dialect being unintelligible and incomprehensible from outside Chile. Me being Mexican i had communication with Chilean people since i was 12, so when i was 16 i was able to mimic that accent 90% exactly like a born Chilean (a Chilean told me so, so i had Chilean certification in imitating Chilean way to speak). I hope someone finds this rubbish i wrote interesting. Tula is love, Tula is life. Edit: i'm Mexican, so correct me in anything if i'm wrong, i'm talking about Chilean stuff without having a foot over there ever, correct me. :D

I legit just finished my course on thiery of computer science where i had to make a TM that computed xor of bits. And figuring out that states are just branches in a tree was just insane. 😂

Can you implement zipping as well? The reason being that the error checking you added to prevent ambiguous cases prevents a nicety for simplifying rule 110 i.e. let bits = { . # } let table = { (. . . .), (. . # .), } for _ in bits { for (a b c d) in table case (R a b c) _ d -> (I b) } which could still be accomplished if you allow zipping equal length sets, one of 3-tuples and 1 of atoms

Am I going crazy or is this the same stream you edited for your main channel?

Please mark the video as Tula ep. 2 It is little bit confusing without the mark

tsoding, I love how you handle tula (as a chilean)

self host when

idea for a quantum programming language name: "QuanTum ,ASsembly" or "qtas" for short (polish, czech , slovak for "dick" but spelled with "q" instead of "ku")

Thank you.....

54:36 that sounds like how "prolog" works to me lol

Nice project! Hate Rust btw :D

hi zoz

hi mr zoz

Try the Monicelli language 😂

Can I get this comment hearted for my birthday?

test

Put rust logo in thumbnail so we can skip it and do not waste time on it

Instead of these boring crappy languages, make a lisp supporting garbage collection, tail call optimization and a macro system.