Stack Based Language in C | Part 12 Proving our Language is Turing Complete
In this project we will implement a stack based language in C. Today we will implement the memory data type and prove the language is Turing Complete by doing rule 110.
stack-lang https://github.com/alexjercan/stack-l...
compiler-tutorial https://github.com/alexjercan/compile...
cool https://github.com/alexjercan/cool-co...
ds.h https://github.com/alexjercan/ds.h
Support me on Patreon! / alexthedev
Join this channel to get access to perks
/ @alextherealdev
If you enjoy my work, consider buying me a cup of coffee for getting through those long coding sessions :)
My Dotfiles! https://github.com/alexjercan/nix.dot...
Discord server! / discord
Chapters:
00:00:00 Implement memory
01:13:37 Implement rule110
04:07:39 results and plans
Watch video Stack Based Language in C | Part 12 Proving our Language is Turing Complete online without registration, duration hours minute second in high quality. This video was added by user Alex The Dev 11 November 2024, don't forget to share it with your friends and acquaintances, it has been viewed on our site 20 once and liked it people.