Everybody who understands the working of a Turing machine and that of SQL understands, that SQL probably isn’t Turing complete, i.e. you can’t use it to build a Turing machine. Yet I’m going to show that you actually can implement a Turing Engine using Oracle SQL.
So for those among you who haven’t studied informatics: “What is a Turing machine?”
A Turing machine is a theoretical, extremly simple computer. It consists of an endless array (often called tape), that can store a symbol on every position, and the ‘head’ that is positioned at a specific position of the tape. The Turing machine works as follows: The head reads the symbol in the array at its current position. Depending on the current state of the head, and the symbol read, it writes a new symbol in the array at the current position, and moves one step to the right or left. It continues to do so, until it reaches a final state.
Turing machines are interesting, because everything a computer can calculate, can be calculated using a Turing machine and vice versa. The fact that the memory of a real computer is limited can be ignored, as long as it is ‘big enough’.
Since there is no way to iterate in SQL, neither directly nor by means of recursion, it is hard to imagine, how such a machine could be implemented using SQL.
Enter the model clause. The model clause is a Oracle specific extension to SQL. It is supposed to allow Excel like manipulation on resultsets of a SQL statement. Basically you do a normal Select statement, add a model clause, and in the model clause you can adress any cell of your resultset, and you can even add rows or columns. This is done using a very limited iterative language. This feature exists since Oracle 10g (2004?), but I haven’t seen it used in a production system (thank godness), actually I haven’t found a person in real live that actualy knows this feature. One reason is probably that Oracle managed to create the worst language I have seen so far, and I have worked with XSLT, Visual Basic 5, Fortran 66 and 6502 Assembler.
So let’s implement the Turing machine. We need the tape and the definition of how the Turing machine should behave, it’s program. Since we are in a database this will get stored in tables:

DROP TABLE tape;drop TABLE machine; — holds the program of the machinecreate table tape (position number, symbol varchar2(1) not null);alter table tape add constraint tape_pk primary key (position);create table machine (state number, input varchar2(1), output varchar2(1), head_move number(1) not null, next_state number);alter table machine add constraint machine_pk primary key (state, input);
In order to test our Turing machine we need an initial state and a program. Since I’m no expert on Turing machine programming I copied that from the german Wikipedia page. The initial state are just two 1s, and the program is supposed to copy all the continuous 1s it finds, with a separating 0 in between:

— create programinsert into machine (state, input, output, next_state, head_move) values (1,1,0,2,1);insert into machine (state, input, output, next_state, head_move) values (1,0,0,6,0);insert into machine (state, input, output, next_state, head_move) values (2,1,1,2,1);insert into machine (state, input, output, next_state, head_move) values (2,0,0,3,1);


INSERT INTO machine (state, input, output, next_state, head_move) VALUES (3,0,1,4,1);


INSERT INTO machine (state, input, output, next_state, head_move) VALUES (3,1,1,3,1);


INSERT INTO machine (state, input, output, next_state, head_move) VALUES (4,1,1,4,1);


INSERT INTO machine (state, input, output, next_state, head_move) VALUES (4,0,0,5,1);


INSERT INTO machine (state, input, output, next_state, head_move) VALUES (5,1,1,5,1);


INSERT INTO machine (state, input, output, next_state, head_move) VALUES (5,0,1,1,1);— create initial state:


INSERT INTO tape (position, symbol) VALUES (0,1);


INSERT INTO tape (position, symbol) VALUES (1,1);
Now comes the actual work. If you are only interested in the final solution, scroll all the way to the end of the article. But if you follow along you can see how I developed the program. This should teach you a little about the model clause, and why you shouldn’t use it for anything real.
First step, get any model clause at all to work:

SELECT * FROM tapemodeldimension BY (position)measures (symbol)rules iterate(3) (


symbol[any] = symbol[cv()]*2


)


ORDER BY position;
The first line selects the intial state from the tape. The second line starts the model clause. dimension by (position) allows us to access a row by its position value. Think of it as an array index or primary key. Measures defines the cells we are going to work with. A cell can be accessed with an array like syntax like symbol[23], where 23 it the positionvalue we use to specify the cell. The rules part is the actual program, it doesn’t do anything useful. It only multiplies every symbol with 2 and repeats this 3 times. any references all rows (that’s why it is called any), while cv() references the current value, i.e. the any/cv combination defines an implicit loop over all rows of the model.
Second Step: make the program or the machine accessible. In order to do that we make it a ‘model’ as well. Note that these reference models are read only.

SELECT * FROM tapemodelreference machine_model ON (SELECT * FROM machine) dimension BY (state, input)


measures (output, head_move, next_state)


IGNORE nav — this affects the handling of NULL


main main_model


dimension BY (position)


measures (symbol, 1 current_state, 0 current_position)


rules iterate(3) (


symbol[any] = symbol[cv()]*2


)


ORDER BY position;
Using the measures I also added two column to store the current state of the Turing machine, and the current position of the head. These cells are available for every row of my model, i.e. the tape, but I’m going to use only the one in position 0. Maybe just didn’t look hard enough but I couldn’t find a proper way to define variables.
Now we have all the data structures that we need, we can actually implement the workings of the Turing machine.

SELECT * FROM tapemodelreference machine_model ON (SELECT * FROM machine) dimension BY (state, input)


measures (output, head_move, next_state)


main main_model


dimension BY (position)


measures (symbol, 1 current_state,0 current_position, 0 current_symbol) IGNORE nav


rules iterate(15) (


current_symbol[0] = nvl(symbol[current_position[0]],0),


symbol[current_position[0]] = machine_model.output[current_state[0], current_symbol[0]],


current_position[0] = current_position[0] + machine_model.head_move[current_state[0], current_symbol[0]],


current_state[0] = machine_model.next_state[current_state[0], current_symbol[0]]


)


ORDER BY position;
The real program part are the four lines after rules. The first line reads the current symbol, the second writes the new symbol, depending on the current symbol and the current state. The third line moves the head, and the fourth line sets the new current state. We are almost done.
What’s left is the implementation of stop states. Right now we just iterate 15 times (rules iterate(15)) the little challenge is: The model clause does not offer the equivalent of a while loop. It only knows for loops. Luckily you can exit from a loop with another condition, so when you need a while loop you define a number as being equal to inifinity, and put your exit condition in a until clause, like so:

SELECT * FROM tapemodelreference machine_model ON (SELECT * FROM machine) dimension BY (state, input)


measures (output, head_move, next_state)


main main_model


dimension BY (position)


measures (symbol, 1 current_state,0 current_position, 0 current_symbol) IGNORE nav


rules iterate(10000) until (machine_model.next_state[current_state[0], 0] IS NULL ) ( — if the machine reaches an undefined state it considers it a stop state.


current_symbol[0] = nvl(symbol[current_position[0]],0),


symbol[current_position[0]] = machine_model.output[current_state[0], current_symbol[0]],


current_position[0] = current_position[0] + machine_model.head_move[current_state[0], current_symbol[0]],


current_state[0] = machine_model.next_state[current_state[0], current_symbol[0]]


)


ORDER BY position;
The Turing machine is done and produces the intended output:
position symbol c.state c.position c.symbol 0 1 6 2 0 1 1 1 0 0 2 0 3 1 4 1
So, what do we learn from this?
 Oracle SQL is indeed Turing complete
 Oracle jumped the DSL band waggon already in 2004 and fell of the other side
 You definetly should learn and use the model clause if
 You want to make your code unreadable
 You are a masochist
 You earn your money by betting: “I bet you can’t do this in SQL”
 Other then that the Oracle Clause is just another sign that Oracle doesn’t get anything right if it isn’t inside the database core engine
If you still want to explore the model clause further, I can recommend these links:
http://www.oreillynet.com/pub/a/network/2004/08/10/MODELclause.html
http://rwijk.blogspot.com/2007/10/sqlmodelclausetutorialpartone.html
http://otn.oracle.com/pls/db10g/search?remark=quick_search&word=model+clause