Hrvoje1 Posted March 29, 2019 Posted March 29, 2019 Can computation always be reduced to permutation of certain states of a certain subtrate, or be performed by permutation of these, in every possible model of computation, classical or quantum? Or is it too general statement? 1
studiot Posted March 29, 2019 Posted March 29, 2019 5 hours ago, Hrvoje1 said: Can computation always be reduced to permutation of certain states of a certain subtrate, or be performed by permutation of these, in every possible model of computation, classical or quantum? Or is it too general statement? Would you like to explain further, ?
Hrvoje1 Posted March 29, 2019 Author Posted March 29, 2019 Check this out: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4309123/#idm140111704079712title Here it says: A reversible computation ℭΠ(S) is the task of performing, with or without side-effects, a permutation Π over some set S of at least two possible attributes of some substrate
wtf Posted March 29, 2019 Posted March 29, 2019 14 hours ago, Hrvoje1 said: Can computation always be reduced to permutation of certain states of a certain subtrate, or be performed by permutation of these, in every possible model of computation, classical or quantum? Or is it too general statement? No. Consider the computation that maps every input to zero. That's not reversible and is not a permutation.
Hrvoje1 Posted March 30, 2019 Author Posted March 30, 2019 OK, thanks wtf. I have probably misrepresented the theory from that paper a bit, so let me please rephrase my question. Is permutation the essence of reversible computation? Can reversible computation always be reduced to a permutation, ie be performed by it?
wtf Posted March 30, 2019 Posted March 30, 2019 8 hours ago, Hrvoje1 said: OK, thanks wtf. I have probably misrepresented the theory from that paper a bit, so let me please rephrase my question. Is permutation the essence of reversible computation? Can reversible computation always be reduced to a permutation, ie be performed by it? Not sure what the paper is about. But any reversible process may be represented as a group; and every group may be represented as a group of permutations. That's the famous Cayley's theorem. https://en.wikipedia.org/wiki/Cayley's_theorem 1
Hrvoje1 Posted March 31, 2019 Author Posted March 31, 2019 I think you are right, I believe that is a general idea on which that definiton from the paper is based on. Thank you wtf.
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now