In case you studied the GOTO theoretical language...

From: THE SWARM MASTER (swarm_master_at_hotmail.com)
Date: 01/09/05 

Date: 9 Jan 2005 09:06:36 -0800

Greetings. I have the following conjecture about the GOTO-programs:

Let n be the greatest integer such that X_n appears at least in one
instruction of a given GOTO-program P, and let e be the code of such a
program P. Therefore, if the program P eventually halts on the input
(x_1, ..., x_n), then M instructions have been executed, with M <=
e^(1 + SUM_(i=1)^{n} {x_i}), that is, there is a computation of length
l <= e^(1 + SUM_(i=1)^{n} {x_i}).

Could you prove or disprove this conjecture? I have tried
unsuccessful...

As usual, thanks to all posts in advance.

Relevant Pages