Generative linguistics | Formal languages
In formal language theory, computer science and linguistics, the Chomsky hierarchy (also referred to as the Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars. This hierarchy of grammars was described by Noam Chomsky in 1956. It is also named after Marcel-Paul Schützenberger, who played a crucial role in the development of the theory of formal languages. (Wikipedia).
José Ignacio Burgos Gil: Arithmetic intersection of Bloch higher cycles
The lecture was held within the framework of the Hausdorff Trimester Program: Periods in Number Theory, Algebraic Geometry and Physics. Abstract: We give a new definition of higher arithmetic Chow groups for smooth projective varieties defined over a number field, which is similar to Gill
From playlist Workshop: "Periods and Regulators"
Albert Einstein, Holograms and Quantum Gravity
In the latest campaign to reconcile Einstein’s theory of gravity with quantum mechanics, many physicists are studying how a higher dimensional space that includes gravity arises like a hologram from a lower dimensional particle theory. Read about the second episode of the new season here:
From playlist In Theory
(Part 1) The Palamite Controversy: A Thomistic Analysis by Fr. Peter Totleben, O.P.
A reading of the introduction and chapter 1 (The history of the Palamite controversy) of "The Palamite Controversy: A Thomistic Analysis" by Peter Totleben, O.P. https://www.academia.edu/35580908/The_Palamite_Controversy_A_Thomistic_Analysis
From playlist Palamas and Thomism
Same Story, Different Notation - Computerphile
Finite State Automata meets Recursion. Professor Brailsford continues the story of computers without memory. State Machines versus Chomsky Type 3 Chomsky's Hierarchy: https://youtu.be/224plb3bCog Finite State Automata: https://youtu.be/vhiiia1_hC4 3D Rock Art Scanner: https://youtu.be/
From playlist Chomsky Language Levels
Chomsky Hierarchy - Computerphile
Uncomputable through to finite state - Professor Brailsford explains Chomsky's hierarchy. Turing and the Halting Problem: https://youtu.be/macM_MtS_w4 "Most Difficult Program" - Ackermann Function: http://youtu.be/i7sm9dzFtEI Busy Beaver Turing Machines: https://youtu.be/CE8UhcyJS0I Finit
From playlist Chomsky Language Levels
Computation Ep20, Context Free Grammars (Mar 11, 2022)
This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi
From playlist Math 3342 (Theory of Computation) Spring 2022
Gysin sequences and cohomology ring of symplectic fillings - Zhengyi Zhou
More videos on http://video.ias.edu
From playlist Mathematics
Sentences can be analyzed into hierarchies of constituents. This E-lecture introduces the historical development of phrase structure systems from 1957 until today.
From playlist VLC107 - Syntax: Part II
Noam Chomsky on Theories of Linguistics (Part 2) | Closer To Truth Chats
Closer To Truth has just launched a new website! We can't wait for you to see what we've been working on. New seasons (including the web debut of Season 21), interviews, topic guides, curated playlists, candid conversations, book excerpts, essays, and announcements. Visit today: www.Closer
From playlist Closer To Truth Chats
The Campbell-Baker-Hausdorff and Dynkin formula and its finite nature
In this video explain, implement and numerically validate all the nice formulas popping up from math behind the theorem of Campbell, Baker, Hausdorff and Dynkin, usually a.k.a. Baker-Campbell-Hausdorff formula. Here's the TeX and python code: https://gist.github.com/Nikolaj-K/8e9a345e4c932
From playlist Algebra
Turing Complete - Computerphile
What does it mean for something to be Turing Complete? Professor Brailsford explains. Turing Machine Primer: https://youtu.be/DILF8usqp7M Turing Machines Explained: https://youtu.be/dNRDvLACg5Q Chomsky Hierarchy: https://youtu.be/224plb3bCog What on Earth is Recursion?: https://youtu.be/
From playlist Subtitled Films
Monadic Parsers at the Input Boundary
When reading a byte stream over the process I/O boundary, the first thing which everyone should do is to parse the byte stream with a monadic parser. The talk will discuss Processes and input byte streams. Monadic parsers. What they are and why they matter. The design and use of the pure
From playlist Functional Programming
Chomsky on the "Limits" of Knowledge (1978)
A few clips of Noam Chomsky discussing the limits of knowledge and thought in a 1978 interview with Bryan Magee, and sounding like a dyed-in-the-wool Kantian in the process. This is a version of an upload from the previous channel. The full interview can be found here: https://www.youtube.
From playlist Shorter Clips & Videos - Philosophy Overdose
Computers Without Memory - Computerphile
They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate single purpose computer. Note: Professor Brailsford omitted the transition from the 5 state to 25 state by means of a 20p, he has amended the linked notes!
From playlist Chomsky Language Levels
More grammars: Theory of Computation (Mar 10 2021)
More grammars! This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Class website: http://cstaecker.fairfield.edu/~cstaecker/courses/2021s3342/
From playlist Math 3342 (Theory of Computation) Spring 2021
Maxim Kontsevich - On topological strings and matrix integrals
On topological strings and matrix integrals
From playlist Physique mathématique des nombres de Hurwitz pour débutants
Theory of Computation 6. CFLs and compilers ADUni
From playlist [Shai Simonson]Theory of Computation
