One Way (? Trapdoor) Permutation of a Bennett’s Turing Machine.

September 22, 2014

Congratulations to Alexandre De Castro upon publication of his paper, One-way-ness in the input-saving (Turing) machine, last month in the journal Physica A.

Alexandro purportedly demonstrates that a thermodynamic information-heat engine running infinitesimally close to boundary conditions is reversible if computed without entropy constraint, but non-invertible with entropy constraint. The implication being that a one way permutation is feasible and therefore, by imputation, PNP.
I’m still of the opinion that Alex’s exposition approximates a physical analogue of the function set forth in this blog?
Does an adiabatic thermodynamic bath constitute a ‘trapdoor’?
P.S; Alexandre doesn’t necessarily agree that my function is one way.

*Original Bennett paper here: Logical Reversibility of Computation (1973)

Advertisements

One Response to “One Way (? Trapdoor) Permutation of a Bennett’s Turing Machine.”


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 )

Twitter picture

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

Facebook photo

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

Google+ photo

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

Connecting to %s

%d bloggers like this: