I've been reading up on Reversible Logic and encountered a problem that I can't figure out.
If I have the function f(x, y) = (y, x) which I'm pretty sure is bijective, what is it's inverse? From what I see f(f(RxR)) is equal to f-1(f(RxR)) so that means f = f-1? If it does what is the name for this class of functions, cause I'm pretty sure that a function within this class that performs an operation similar to And or Or would be very useful for me to know about.
If I have the function f(x, y) = (y, x) which I'm pretty sure is bijective, what is it's inverse? From what I see f(f(RxR)) is equal to f-1(f(RxR)) so that means f = f-1? If it does what is the name for this class of functions, cause I'm pretty sure that a function within this class that performs an operation similar to And or Or would be very useful for me to know about.