If a function
f has a
while loop or
for loop, can I compile this function into an
acyclic boolean circuit that ensures that each gate is topologically ordered, i.e. there is no feedback? If so, how exactly is that done, by loop expansion? And if compiling the function as a
cyclic boolean circuit is allowed, does it simplify the circuit structure?
I would appreciate your answer. Thanks!