I have two algorithmsAlgorithm 1:if( Condition1(input)==true )   print(input);else   loop forever;Algorithm 2:if( Condition2(input)==true )   print(input);else   loop forever;for any arbitrary fully-computable conditions 1 and 2.We know both of these algorithms are partially computable.I want to write a new algorithm (algorithm 3) like this:if algorithm1 prints x and algorithm2 does not print x if and only if algorithm3 print xCan I write algorithm3? And how?
Algorithm for difference of two semi-decidable languages
computability