My Next Video Project (Tula Ep.01)

preview_player
Показать описание

References:
Рекомендации по теме
Комментарии
Автор

Twitch chat as a subtitle option? mr zozin is truly living in a time far beyond our own. very creative, thank you mr zozin 👍

fishsayhelo
Автор

I really liked Ada's video and how it was explained, I learned a lot, I hope you can make more videos like this

juanc.
Автор

I really like the format of the Ada video, one of your best for sure.

cobbcoding
Автор

I love watching the whole process, the whole vods… it is also informative and for me it’s quite relaxing seeing some good quality code and the process of carving it .

priyakdey
Автор

I had lectures on turing machines just last semester, so here are some notes on formal TMs (according to my knowledge). If you care about formal TMs as long as the TM works for your use cases / programs is up to you ofc))
- The alphabet usually contains at least a NULL symbol and a SEPARATOR symbol. beyond the input data the tape is filled with NULL to infinity
- There is one head per tape but there may be multiple tapes. this makes certain programs easier to write but a single head does not restrict computational power
- some TMs implement a STANDSTILL move next to left and right, this does not affect computational power but makes certain programs easier to write
- non determinism increases the computational power of a TM, this is achieved using multiple instructions for a single STATE+READ tuple and splitting exwcution in parallel branches
- a formal TM only halts and accepts when it reaches the halting state. a missing case does not equal an accepting halt but rather a NOOP. In a single tape TM this inevitably leads to the machine getting stuck and never halting. This behaviour is actually important regarding computability and the halting problem

glebunov
Автор

43:40 Yeah, the function of lifetimes (in function args) is to explain to the compiler which input parameter reference the reference you're returning comes from. It's annoying, but once you do it, the compiler can statically check that you're correct.

valshaped
Автор

I love the content ... fav work in RUST/C/JAI ... love the project selection ... highly recommend this channel for learning and entertainment

limplash
Автор

I initially thought tsoding was a play on TypeScript Coding. Glad I read the title!

johnsearing
Автор

Restricting the tape to only be infinite to the right does not impact the computational power of the Turing Machine anyway. Both models are equivalent.

waynee
Автор

0:08: "Удмурт", "Банкетный", "Говорун"...

Konleian
Автор

Looks like a fun project to follow. Can't wait to see the final video, too. 👍

divingeveryday
Автор

Ada video was amazing. Looking forward to more.

taraskuzyk
Автор

Congrats for your new project. I'm very happy watching it. Some notes:
- it looks weird with LSB on the left
- expanding tape to the left is as easy as expanding it to the right
- empty tape can default to zero (0)
- `Halt` can be a known keyword.
- the machine can rise exception when settings a `symbol` without a define `case`.

MiroslavPopov
Автор

Love you sir love you soo much can you plz do more for YouTube like upload all your projects here too.
🙏🙏

tichalagaming
Автор

This one was super cool, can't wait for the next episode! :)

sasakanjuh
Автор

yes, a summary video will be f-ing great.

gahshunker
Автор

Ok, ok, ok, I'm only up to 3:22 but why not start from the lambda-calculus perspective given your background with functional? Or is that the point, have a break from functional?

stretch
Автор

who needs a lexer?! I've been splitting all my life

cheebadigga
Автор

reading binary left to right is harder than I initially thought it''d be

ovi
Автор

every time i take a glance at your stream preview and it reminds me of windows 8

parthokr