Last Tech Tuesday I celebrated the second anniversary by providing a big recap of what I had covered to date. I was planning to then conduct another survey today about what to write about next. Then it struck me that in order to keep going I need to pick something that will have me jazzed. And so while it may not be immediately useful I have decided to write a bunch of posts on the some of the theory behind computing.

Here are some of the things that I am planning to cover: finite state machines, Turing machines, Turing completeness, complexity, and P vs NP. There are plenty of other theory topics to choose from and please feel free to suggest some in the comments to this post. I will try for most topics to show how they connect to actual applications.  But beyond that I personally get a kick out of how mind bending some of these are and maybe some of my excitement will rub off on readers.

Last Tech Tuesday I celebrated the second anniversary by providing a big recap of what I had covered to date. I was planning to then conduct another survey today about what to write about next. Then it struck me that in order to keep going I need to pick something that will have me jazzed. And so while it may not be immediately useful I have decided to write a bunch of posts on the some of the theory behind computing.

Here are some of the things that I am planning to cover: finite state machines, Turing machines, Turing completeness, complexity, and P vs NP. There are plenty of other theory topics to choose from and please feel free to suggest some in the comments to this post. I will try for most topics to show how they connect to actual applications.  But beyond that I personally get a kick out of how mind bending some of these are and maybe some of my excitement will rub off on readers.