Course info
Dec 16, 2015
2h 20m

'On Computable Numbers...' lays out the foundation of what today we call the theory of computation. Turing points out that there are sequences of zeros and ones that no computer can generate. He also cracked one of the outstanding problems in formal logic at the time, the Endtscheidungsproblem, or decision problem. This course from the point of view of programmer, not a mathematician.

About the author
About the author

Dan is an independent consultant, author, and speaker. He likes data; pointy data, rectangular data, even data just lying around on the floor. He is a co-author of the book "A Developers Guide to SQL Server 2005". His articles have been published in MSDN Magazine and SQL Server Magazine and he has spoken at WinDev, Microsoft events, as well as to various developer groups.

More from the author
XML Fundamentals
4h 51m
May 11, 2012
.NET Regular Expressions
3h 29m
Oct 31, 2011
More courses by Dan Sullivan