Question: Starting with the given flow, use the flow-augmentation algorithm to find a maximal flow, and the corresponding minimal cut, in the network at left below.


Starting with the given flow, use the flow-augmentation algorithm to find a maximal flow, and the corresponding minimal cut, in the network at left below. Prove by induction on n that if the TM (at right above) is started with a blank tape, after 10 n + 5 steps the machine will be in state 4 with the tape reading .. 0(0111)^n 01110... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
