The History of the Turing Principle

The speed of an algorithm is independent of any specific computing device okay so a computing device might be faster or slower you have faster computers and slower computers but the algorithm itself has a speed if you will. that's where we talked about class p polynomial time is faster than class mpclass mp includes class p but anything that's in mp that isn't p would then be exponential and exponential just as intractableYou just can't do very much with the algorithm we have too many if what you're trying to work with is too large of an input size then it's just going to take forever I also mentioned that my interest in artificial intelligence is because it's the study of what do you