Back
Add Comment
Topics
Vote
Results
structured program theorem
theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous