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 machi...

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 machi...

As promised (threatened?) Tech Tuesday is embarking on a look at the theoretical side of computer science. We also call this the theory of computation and it deals with two big questions: first, what are the limits to computation (known as computability) and second, how efficiently can we compute things (known as computational complexity). Now in order to be able to make formal arguments in trying to answer these questions it helps a lot to have models of computation that are simpler and more...

As promised (threatened?) Tech Tuesday is embarking on a look at the theoretical side of computer science. We also call this the theory of computation and it deals with two big questions: first, what are the limits to computation (known as computability) and second, how efficiently can we compute things (known as computational complexity). Now in order to be able to make formal arguments in trying to answer these questions it helps a lot to have models of computation that are simpler and more...