Universal Turing Machines, Part 2: The encoding and overall design

The encoding for a machine with any number of states and any number of symbols: Each state and each symbol will be numbered in binary, all the numbers must be padded to the same length. So, we can have symbols…

Universal Turing Machines, Part 1: The Journey Begins.

This past weekend I spent some time working with Turing Machines. More specifically, I implemented a busy beaver machine. After that I worked on getting Ullman and Hopcroft’s UTM to simulate the machine that recognizes (01)* with input 010101. I…

Workin’ for the Man

This last week, I showed what I’ve been working on for the last 7 months to my superior, only to be shot down. I’m responsible for ‘porting’ (really, it’s a complete rewrite) a Geospatial Information program from M$ windows to…

Linguistic Engineering

I’m going to found the field of Linguistic Engineering. I wish to study the relationship between what people think (algorithms) and what they say (programs), with the end goal being a set of design principles for the creation of programming…

Natural Programming

I read an article today about Natural Programming. This really piques my interest, because the psychologists have had to study how humans wish to translate their thoughts into a working program. Of course, the research done has necessarily been limited…