EDN Admin
Well-known member
[Broken External Image]:http://ecn.channel9.msdn.com/o9/ch9/0/9/2/8/5/5/C9AlgorithmsGurevichIntroAndHistory_85_ch9.pngIn mathematics, computer science, and related subjects, an algorithm is an effective method for solving a problem expressed as a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields. (In more advanced or abstract settings, the instructions do not necessarily constitute a finite sequence, or even a sequence; see, for example, "nondeterministic algorithm".)
Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness. [source = Bing Reference]
Here, the great Yuri Gurevich, mathematician, computer scientist and inventor of abstract state machines, will*teach us about algorithms beginning with this introductory lecture that includes plenty of historical context. This is the first in a series of lectures exploring the fundamental logic that powers all that we as software engineers and computer scientists do in computing--the algorithm. What is an algorithm, exactly? You may be surprised to learn that this is actually not a very simple question...
Find some time to watch this introduction on a truly fascinating*topic by one of the worlds premiere minds in the field of mathematical logic and algorithms. We designed this to*increase*in complexity over time, like a typical college course,*so Yuri moves slowly through several topics, providing plenty of time for viewers to catch up before moving on to more advanced topics.
Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit*with Niner nation. We all really appreciate it! Thanks, too, to Karsten and Sampy for being our live audience for this lecture and asking great questions!
[Broken External Image]:http://channel9.msdn.com/558290/WebViewBug.aspx?EVT=0
More...
Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness. [source = Bing Reference]
Here, the great Yuri Gurevich, mathematician, computer scientist and inventor of abstract state machines, will*teach us about algorithms beginning with this introductory lecture that includes plenty of historical context. This is the first in a series of lectures exploring the fundamental logic that powers all that we as software engineers and computer scientists do in computing--the algorithm. What is an algorithm, exactly? You may be surprised to learn that this is actually not a very simple question...
Find some time to watch this introduction on a truly fascinating*topic by one of the worlds premiere minds in the field of mathematical logic and algorithms. We designed this to*increase*in complexity over time, like a typical college course,*so Yuri moves slowly through several topics, providing plenty of time for viewers to catch up before moving on to more advanced topics.
Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit*with Niner nation. We all really appreciate it! Thanks, too, to Karsten and Sampy for being our live audience for this lecture and asking great questions!
[Broken External Image]:http://channel9.msdn.com/558290/WebViewBug.aspx?EVT=0
More...
