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

Advertisements