Automata (computation)

Recognizable set

In computer science, more precisely in automata theory, a recognizable set of a monoid is a subset that can be distinguished by some morphism to a finite monoid. Recognizable sets are useful in automata theory, formal languages and algebra. This notion is different from the notion of recognizable language. Indeed, the term "recognizable" has a different meaning in computability theory. (Wikipedia).

Video thumbnail

Set Game

SET is an awesome game that really gets your brain working. Play it! Read more about SET here: http://theothermath.com/index.php/2020/03/27/set/

From playlist Games and puzzles

Video thumbnail

Introduction to Sets and Set Notation

This video defines a set, special sets, and set notation.

From playlist Sets (Discrete Math)

Video thumbnail

How to Identify the Elements of a Set | Set Theory

Sets contain elements, and sometimes those elements are sets, intervals, ordered pairs or sequences, or a slew of other objects! When a set is written in roster form, its elements are separated by commas, but some elements may have commas of their own, making it a little difficult at times

From playlist Set Theory

Video thumbnail

Introduction to sets || Set theory Overview - Part 2

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty

From playlist Set Theory

Video thumbnail

Introduction to sets || Set theory Overview - Part 1

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty

From playlist Set Theory

Video thumbnail

Set Theory (Part 3): Ordered Pairs and Cartesian Products

Please feel free to leave comments/questions on the video and practice problems below! In this video, I cover the Kuratowski definition of ordered pairs in terms of sets. This will allow us to speak of relations and functions in terms of sets as the basic mathematical objects and will ser

From playlist Set Theory by Mathoma

Video thumbnail

Introduction to Set Theory

This video introduces the basic vocabulary used in set theory. http://mathispower4u.wordpress.com/

From playlist Sets

Video thumbnail

The perfect number of axioms | Axiomatic Set Theory, Section 1.1

In this video we introduce 6 of the axioms of ZFC set theory. My Twitter: https://twitter.com/KristapsBalodi3 Intro: (0:00) The Axiom of Existence: (2:39) The Axiom of Extensionality: (4:20) The Axiom Schema of Comprehension: (6:15) The Axiom of Pair (12:16) The Axiom of Union (15:15) T

From playlist Axiomatic Set Theory

Video thumbnail

Set Theory (Part 2): ZFC Axioms

Please feel free to leave comments/questions on the video and practice problems below! In this video, I introduce some common axioms in set theory using the Zermelo-Fraenkel w/ choice (ZFC) system. Five out of nine ZFC axioms are covered and the remaining four will be introduced in their

From playlist Set Theory by Mathoma

Video thumbnail

8. Undecidability

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. Showed that natural numbers and real n

From playlist MIT 18.404J Theory of Computation, Fall 2020

Video thumbnail

Émilie Charlier: Logic, decidability and numeration systems - Lecture 1

Abstract: The theorem of Büchi-Bruyère states that a subset of Nd is b-recognizable if and only if it is b-definable. As a corollary, the first-order theory of (N,+,Vb) is decidable (where Vb(n) is the largest power of the base b dividing n). This classical result is a powerful tool in ord

From playlist Mathematical Aspects of Computer Science

Video thumbnail

Fabien Durand - Sur le Théorème de Cobham (Part 1)

Sur le Théorème de Cobham (Part 1) Licence: CC BY NC-ND 4.0

From playlist École d’été 2013 - Théorie des nombres et dynamique

Video thumbnail

9. Reducibility

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. Discussed the reducibility method to p

From playlist MIT 18.404J Theory of Computation, Fall 2020

Video thumbnail

Michael Singer 4/8/16 Part 1

Title: Consistent Systems of Linear Differential and Difference Equations April 2016 Kolchin Seminar Workshop

From playlist April 2016 Kolchin Seminar Workshop

Video thumbnail

A Spirit of Trust: Magnanimity and Agency in Hegel’s Phenomenology

Robert Brandom is Distinguished Professor of Philosophy and Fellow at the Center for Philosophy of Science at the University of Pittsburgh. He is the author of thirteen books, including Making It Explicit: Reasoning, Representing, and Discursive Commitment. His most recent book, A Spirit o

From playlist Franke Lectures in the Humanities

Video thumbnail

6. TM Variants, Church-Turing Thesis

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. Showed that various TM variants are al

From playlist MIT 18.404J Theory of Computation, Fall 2020

Video thumbnail

Lecture 4.2: Shimon Ullman - Atoms of Recognition

MIT RES.9-003 Brains, Minds and Machines Summer Course, Summer 2015 View the complete course: https://ocw.mit.edu/RES-9-003SU15 Instructor: Shimon Ullman Human ability to recognize object categories from minimal content in natural image fragments, inadequacy of current computer vision mod

From playlist MIT RES.9-003 Brains, Minds and Machines Summer Course, Summer 2015

Video thumbnail

11. Recursion Theorem and Logic

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. Discussed self-reference and the recur

From playlist MIT 18.404J Theory of Computation, Fall 2020

Video thumbnail

Jean-Eric Pin: A noncommutative extension of Mahler’s interpolation theorem

Talk by Jean-Eric Pin in Global Noncommutative Geometry Seminar (Americas) https://globalncgseminar.org/talks/tba-10/ on April 0, 2021

From playlist Global Noncommutative Geometry Seminar (Americas)

Video thumbnail

Python: Sets and Set Builder

Sets allow you to store multiple values in one place, but unlike lists, sets are unordered and there are no duplicates. In this video, we will use IDLE to enter some set expressions and see the results. We will also learn about set-builder notation to construct sets mathematically. Get

From playlist Python

Related pages

Rational set | Finitely generated group | Kleene star | Regular language | Subgroup | Syntactic monoid | Rational monoid | Computability theory | Formal language | Algebra | Free monoid | Automata theory | Monoid