Tree stack automaton

Frank Buss' Hexagonal Cellular Automaton

Frank Buss' Hex Cellular Automaton, initialized with a glider gun and a rake. http://www.frank-buss.de/automaton/hexautomaton.html Generated with Ready: http://code.google.com/p/reaction-diffusion/

From playlist Ready

Parabolas 9 Algebra Regents

In this video we review the basic components of a parabola

From playlist Parabolas

Coding Wireworld Cellular Automaton in C++/SFML

Hello everybody! This time, I will be creating Wire World, which is little bit different than some of the other cellular automatons i have made, but still quite cool none the less :) Hope you enjoy! ========= DOWNLOAD: https://github.com/Hopson97/CellularAutomaton/releases/ SOURCE CODE:

From playlist Creating Cellular Automaton

Marble automata

I found the plans for this model on this site (http://scrollsawworkshop.blogspot.com.br/2008/10/marble-automation-machine.html). Free 3D model at https://skfb.ly/o6vRE.

From playlist Marble Machines

Amazing railway track laying machine

I want one of these.

From playlist Science

4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion

MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Quickly reviewed last lecture. Defined context free grammars (CFGs) a

From playlist MIT 18.404J Theory of Computation, Fall 2020

A Computer Built With Dominos

By arranging enough dominos into just the right structure, we can build a computer. But how do we arrange dominos in such a way that they can perform computation? Here, we explore the process of building domino logical circuits by carefully arranging dominos into configurations that can co

From playlist Spanning Tree Favorites

Coding "Conway's Game of Life" Cellular Automaton in C++/ SFML

Coways Game of life is a very famous cellula automaton, created by John Conway. In this video, I implement it in C++ and SFML. ========= DOWNLOAD: https://github.com/Hopson97/CellularAutomaton/releases/tag/v1.1 SOURCE CODE: https://github.com/Hopson97/CellularAutomaton ========= RESOUR

From playlist Creating Cellular Automaton

Using Autotiling on i3 Makes It Even BETTER!

Today I talk about Autotiling on i3wm. 👇 PULL IT DOWN FOR THE GOOD STUFF 👇 Patreon - https://patreon.com/thelinuxcast Liberapay - https://liberapay.com/thelinuxcast/ Youtube - https://www.youtube.com/channel/UCylGUf9BvQooEFjgdNudoQg/join ===== Follow us 🐧🐧 ====== Discord - https://discor

From playlist Window Managers

5. CF Pumping Lemma, Turing Machines

MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Quickly reviewed last lecture. Proved the CFL pumping lemma as a tool

From playlist MIT 18.404J Theory of Computation, Fall 2020

What We've Learned from NKS Chapter 5: Two Dimensions and Beyond

In this episode of "What We've Learned from NKS", Stephen Wolfram is counting down to the 20th anniversary of A New Kind of Science with [another] chapter retrospective. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or th

From playlist Science and Research Livestreams

ElixirConf 2015 - The road to intellij-elixir 1.0.0 By Luke Imhoff

Learn how naively copying a grammar file from one parser generator to another won't work. Go back to the beginning and learn about lexers vs parsers, but discover that the power of interpolation changes the computational complexity and forces the lexer to be a push-down automata instead of

From playlist ElixirConf 2015

Introduction to tree algorithms | Graph Theory

An introduction to tree algorithms. This video covers how trees are stored and represented on a computer. Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube: https://www.udemy.com/course/graph-t

From playlist Tree Algorithms

RailsConf 2018: Re-graphing The Mental Model of The Rails Router by Vaidehi Joshi

Re-graphing The Mental Model of The Rails Router by Vaidehi Joshi Rails is incredibly powerful because of its abstractions. For years, developers have been able to hit the ground running and be productive without having to know the in's and out's of the core computer science concepts that

From playlist RailsConf 2018

What We've Learned from NKS Chapter 11: The Notion of Computation

In this episode of "What We've Learned from NKS", Stephen Wolfram is counting down to the 20th anniversary of A New Kind of Science with [another] chapter retrospective. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or th

From playlist Science and Research Livestreams

High-Confidence Predictions under Adversarial Uncertainty - Andrew Drucker

Andrew Drucker Massachusetts Institute of Technology February 13, 2012 We study the setting in which the bits of an unknown infinite binary sequence x are revealed sequentially to an observer. We show that very limited assumptions about x allow one to make successful predictions about unse

From playlist Mathematics

RustConf 2017 - Menhir and Friends: the State of the Art of Parsing in Rust by Naomi Testard

Menhir and Friends: the State of the Art of Parsing in Rust by Naomi Testard In this talk we present Menhir, a very powerful LR parsers generator, and how to use it to write Rust parsers (and lexers). We also show some details of the internals of Menhir’s backend for Rust, as well as a sh

From playlist RustConf 2017

RustConf 2017 - Menhir and Friends: the State of the Art of Parsing in Rust by Naomi Testard

Menhir and Friends: the State of the Art of Parsing in Rust by Naomi Testard In this talk we present Menhir, a very powerful LR parsers generator, and how to use it to write Rust parsers (and lexers). We also show some details of the internals of Menhir’s backend for Rust, as well as a sh

From playlist RustConf 2017

Ville Salo: Nilpotent endomorphisms of expansive group actions

We say a pointed dynamical system is asymptotically nilpotent if every point tends to zero. We study group actions whose endomorphism actions are nilrigid, meaning that for all asymptotically nilpotent endomorphisms the convergence to zero is uniform. We show that this happens for a large

From playlist Dynamical Systems and Ordinary Differential Equations

Turboprop Engine

http://www.mekanizmalar.com/menu_engine.html

From playlist Turbines