As someone with numerous difficulties learning mathematics concepts, this is the best series I've ever seen by far. I can actually understand and follow very easily, which is awesome. Thank you.
I can only imagine the huge effort you've put it into this work, researching, finding questions of audience, writing it down.. RESPECT and thank you for sincerity, coz many just brush up on the surface. But not you.
Many many thanks, this is very useful and you are the first one that understand that someone may not know what the symbols mean and you give first all sort of definitions needed. This series looks promising
I'm currently taking CS 311 at Portland State and I've been using these videos as a supplement to the lectures. Thank you very much for taking the time to be thorough and understandable in your explanations.
Doing a degree in computer science. The university I go to has me bogged down in boring informatics which are required. Watching this to refresh my interest in computer science. Love this stuff!
This is great. Thank you, Professor Porter. Some quick points, in descending order of importance. [1] The term "relation" is also used in the sense of simple a subset of the cartersian product of two sets (see, e.g. Cameron: Sets, Logic, and Categories). In this sense, a function is a kind of relation, and every function is a relation, but not every relation is a function. In this lecture, you've introduced relation in the sense of a k-ary predicate for k greater than 1. And since predicate is a function where the co-domain is {True, False}, a relation in this sense is a special kind of function, so every relation is a function but not every function is a relation. Now, it is clear these are two quite distinct senses of "relation". To avoid confusion, I think it might have been useful to mention the first sense of "relation" and so clearly mark the distinction, especially as you go on to explain reflexivity, symmetry, and transitivity of relations, and these definitions also apply to "relation" in the first sense. [2] You used the term "range" when perhaps it would have been better to use the term "co-domain". I find it useful to keep the two terms distinct. The range, strictly speaking, is only a subset of the co-domain, consisting of every element of the co-domain for which there is some element of the domain (possibly more than one) mapping onto it. And of course it may be that every element of the co-domain is like this, in which case the range and co-domain coincide, but this is not always the case. [3] In early on in the video you said "greater than" when you meant "greater than or equal to" (I suppose you could rectify this with a caption). [These comments are offered by way, I hope, of helpful suggestion. I greatly enjoyed your clear and excellent presentation. Thank you again.]
Thanks for posting these. I'm going to be studying the Theory of Computation in University next semester and I want to get ahead. I think your videos are really going to help me.
I am of the view that for a topic this demanding students aught to be regarded like 5 years olds . Needless to say more students would pass with flying colours. Clearly this professor addresses the problems faced by students learning this sort of material for first time. I am quite chuffed actually.
Hello professor Porter, at 25:32 you are using the same symbol € (that's the best match on my keybord) to denote both an empty string and the "element of" relation. Isn't that kind of ambiguous, especially where context free grammars are involved?
thank you for posting the video. for some reason i have an easier time understanding your video, than my instructors who are native german speakers (like me).
If I was in his class; Professor: Hello, I'm professor Harry Porter Me: Harry Potter? Professor: No, Porter Me: Potter? Professor: No HARRY PORTER Me: Ok Professor Potter
Find if given set of production of grammar make it ambiguous S-> if b then U S-> if b then U else S S->a U->a U->for c do S U->a Can anyone prive me solution for this ?
World class teaching style. This guy really cares. Incredibly thankful for these video series.
he wrote all that carefully with his own hands , wow
Came for theory of computation... But was so amazed by your name...
Good style of beer
hey, it's been 8 years since your college, how are you doing and are you a computer scientist or in the domain related to academics?
As someone with numerous difficulties learning mathematics concepts, this is the best series I've ever seen by far. I can actually understand and follow very easily, which is awesome. Thank you.
I can only imagine the huge effort you've put it into this work, researching, finding questions of audience, writing it down.. RESPECT and thank you for sincerity, coz many just brush up on the surface. But not you.
Many many thanks, this is very useful and you are the first one that understand that someone may not know what the symbols mean and you give first all sort of definitions needed. This series looks promising
I'm currently taking CS 311 at Portland State and I've been using these videos as a supplement to the lectures. Thank you very much for taking the time to be thorough and understandable in your explanations.
I learned more from this video than I did all semester in my own class. Thank You so much because this is saving me for the final exam.
I applaud you on creating such an incredibly coherent and comprehensive video. I will definitely be watching more.
Want to say a big thank you to you. I am learning computation and have been struggling with it due to not having this foundation. Loads of thanks
Unexpectedly Excellent Discrete Maths overview / primer (especially at only 45 minutes length!) Looking forward to the rest of the series!
Thank you for posting these videos, they are greatly helping me catch up on my coding theory classes.
Doing a degree in computer science. The university I go to has me bogged down in boring informatics which are required. Watching this to refresh my interest in computer science. Love this stuff!
in the same boat
wish I'd found you a little earlier than the night before my exam! great stuff anyway :)
This is great. Thank you, Professor Porter. Some quick points, in descending order of importance. [1] The term "relation" is also used in the sense of simple a subset of the cartersian product of two sets (see, e.g. Cameron: Sets, Logic, and Categories). In this sense, a function is a kind of relation, and every function is a relation, but not every relation is a function. In this lecture, you've introduced relation in the sense of a k-ary predicate for k greater than 1. And since predicate is a function where the co-domain is {True, False}, a relation in this sense is a special kind of function, so every relation is a function but not every function is a relation. Now, it is clear these are two quite distinct senses of "relation". To avoid confusion, I think it might have been useful to mention the first sense of "relation" and so clearly mark the distinction, especially as you go on to explain reflexivity, symmetry, and transitivity of relations, and these definitions also apply to "relation" in the first sense. [2] You used the term "range" when perhaps it would have been better to use the term "co-domain". I find it useful to keep the two terms distinct. The range, strictly speaking, is only a subset of the co-domain, consisting of every element of the co-domain for which there is some element of the domain (possibly more than one) mapping onto it. And of course it may be that every element of the co-domain is like this, in which case the range and co-domain coincide, but this is not always the case. [3] In early on in the video you said "greater than" when you meant "greater than or equal to" (I suppose you could rectify this with a caption). [These comments are offered by way, I hope, of helpful suggestion. I greatly enjoyed your clear and excellent presentation. Thank you again.]
Thank you so very much. You are an incredible teacher and I love all the videos you share. Thank you for inspiring us.
Thank you so much!
Excellent tutorials on Automata.
Any tutorials on Compiler Design ?
thank you so much sir.. your videos helped a lot.. done with the exam and got result too..
- graduate student
A wizard teaching computer science?
Thanks for posting these. I'm going to be studying the Theory of Computation in University next semester and I want to get ahead. I think your videos are really going to help me.
So happy I stumbled on this. I'll be sure to watch your other videos!
the best turtorial! thank you so much. you explain very good!
He is like the no bullshit version of Harry Potter, literally.
tbh best math tutorial for students of computer science
Thank you, prof. Harry Potter!
That was.. um.. Magical! 😊
Incredible, thank you very much for making these
This is very helpful as a supplement for review.
What a Great lecture , thanks professor
... you're a math wizard 'arry
I am of the view that for a topic this demanding students aught to be regarded like 5 years olds . Needless to say more students would pass with flying colours. Clearly this professor addresses the problems faced by students learning this sort of material for first time. I am quite chuffed actually.
Hello professor Porter, at 25:32 you are using the same symbol € (that's the best match on my keybord) to denote both an empty string and the "element of" relation. Isn't that kind of ambiguous, especially where context free grammars are involved?
Wait did you say you are Harry Potter? :) What are you doing teaching muggles computation instead of teaching wizards spells!!
computer science is the new wizardry
"Harry Potter and the theory of computation" by J.K.Rowling
Thank for the videos. It's very, very good.
God bless you.
thank you for posting the video. for some reason i have an easier time understanding your video, than my instructors who are native german speakers (like me).
The lower video resolution of your latter videos is annoying. I believe brighter lights might have overcome the problem. Fantastic series by the way.
Really Gr8 Tutorial.. I am on to it....
Thanks for these
Very good lecture! thank you sir!
Is this a higher level course in Statistics called Power Computations?
pretty good lecturer
sir you missed Rice's Theorem please cover it ..rest of the videos are awesome
Harry Porter teaching us witch craft.
Excellent!
This is priceless! THX!
Harry Potter O.o I always knew there was some wizardry going on in TOC
You can tell the parents made good use of their last name
Thank you so much
i think jk rowling wrote a book about you
maybe you were childhood friends
Good Work...
How is this related to Hogwarts admision exam?
Gold - 64 lectures to go.
is notation syntax?
Is that pencil or wand?
Where is Dumbledore?
Sir do u also have the special scar in ur forehead 👀
@Michael Ordway which university because im also taking it next semester
Harry Potter changed his major.
thanks, very useful.
Thank you so much..!!!
this is the good stuff
If I was in his class;
Professor: Hello, I'm professor Harry Porter
Me: Harry Potter?
Professor: No, Porter
Me: Potter?
Professor: No HARRY PORTER
Me: Ok Professor Potter
Also, this series is phenomenal!
Shortly you have to know basics of discrete math
EITICI Institute is using your videos for paid courses, I don't think this is fair unless you agreed with them.
When the professors name is a bit more interesting than the Decidabilty.
Harry Potter: Hogwarts School of Witchcraft and Wizardry --> Portland State University
Good luck for exams
Find if given set of production of grammar make it ambiguous
S-> if b then U
S-> if b then U else S
S->a
U->a
U->for c do S
U->a
Can anyone prive me solution for this ?
why people on the internet always explain it better than the actual lecturer?
Because actual lecturers want us to go through the same suffering which they once went through during their student lives
Harry "Porter". oooh soo close
Anyone actually watch this video all the way through?
It's not a pen, it's a wand
It's black magic to me.
professor harry potter lolx u kidding me?
His name is Harry PORTER not Harry POTTER ! XD
Harry Potter
harry pottah ??!!
harry potter ??? :v
I didnt know harry potter did computer science