Turing Incomplete

November 23, 2014

I wrote the ‘one way function’ draft over six months ago and have learnt enough in that period to recognise the reference to ‘Turing Machines’ is prattle & should be replaced by ‘algorithm’.
The equation operates as a semi-deterministic algorithm.
That being said, it appears to me, that if appropriately initialised, a Turing Machine could be constructed to traverse the semi-deterministic, ternary-binary lattice implemented by this algorithm?
I hope to update the paper before too much longer, I’ll probably just leave out ‘Turing’ references.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: