EntityQ2635326· pop 13· linked from 16 articlesstructured program theoremSign in to savetheorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iterationConnectionsEdsger W. DijkstraEntityflowchartEntitycontrol flowEntityStephen Cole KleeneEntitygoto statementEntityJournal of the ACMEntityInternational Standard Book NumberEntityJavaEntityJohn von NeumannEntityIBMEntitydigital object identifierEntitybitEntityQ81571EntityDonald KnuthEntityQ131140EntityLibrary of Congress Control NumberEntityvon Neumann architectureEntityprogramming paradigmEntitystructured programmingEntityBrainfuckEntityCategoriesModels of computationProgramming language theoryTheorems in computational complexity theory