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
In programming language theory, the structured program theorem, generally called the Böhm–Jacopini theorem, states that a class of control-flow graphs (historically called flowcharts in this context) can compute any computable function using only the following three control structures to combine subprograms (statements and blocks): Sequence Executing one subprogram, and then another subprogram Selection Executing one of two subprograms according to the value of a boolean expression Iteration Repeatedly executing a subprogram as long as a boolea...
Nº Q2635326 ★★
Incomum · Saberes
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
In programming language theory, the structured program theorem, generally called the Böhm–Jacopini theorem, states that a class of control-flow graphs (historically called flowcharts in this context) can compute any computable function using only the following three control structures to combine subprograms (statements and blocks): Sequence Executing one subprogram, and then another subprogram Selection Executing one of two subprograms according to the value of a boolean expression Iteration Repeatedly executing a subprogram as long as a boolea...
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
In programming language theory, the structured program theorem, generally called the Böhm–Jacopini theorem, states that a class of control-flow graphs (historically called flowcharts in this context) can compute any computable function using only the following three control structures to combine subprograms (statements and blocks): Sequence Executing one subprogram, and then another subprogram Selection Executing one of two subprograms according to the value of a boolean expression Iteration Repeatedly executing a subprogram as long as a boolean expression is true More precise definitions are listed in the next section. The structured chart subject to these constraints, particularly the loop constraint implying a single exit (as described later in this article), may however use additional variables in the form of bits (stored in an extra integer variable in the original proof) in order to keep track of information that the original program represents by the program location. The construction was based on Böhm's programming language P′′. The theorem forms the basis of structured programming, a programming paradigm which eschews the goto statement, exclusively using other control semantics for selection and iteration.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
I
Instrução (informática)
Nº Q925783 ★★
Sem ofertas
-
Álgebra booliana
Álgebras que representam operações lógicas e de conjuntos, em homenagem a Boole
Nº Q173183 ★★★
Sem ofertas
-
Teorema das quatro cores
Nº Q184410 ★★★
Sem ofertas
-
t
teorema de Künneth
Theorem
Nº Q1307676 ★
Sem ofertas
-
L
Linguagem de programação multiparadigma
Nº Q12772052 ★★
Sem ofertas
-
Programação por restrições
Nº Q528588 ★
Sem ofertas
-
Teorema de Millman
Método útil para simplificar a solução de um circuito elétrico
Nº Q588736 ★★
Sem ofertas
-
S
Sistema formal
Nº Q649732 ★★★
Sem ofertas
-
P
Programação orientada a eventos
Nº Q1135914 ★★★
Sem ofertas
-
T
Teorema de Tellegen
Nº Q913327 ★
Sem ofertas
-
T
Teorema de Arzelà-Ascoli
Nº Q1477053 ★★
Sem ofertas
-
Programação imperativa
Nº Q275596 ★★★
Sem ofertas
-
P
Programação procedimental
Nº Q1418502 ★★★
Sem ofertas
-
P
Programação declarativa
Nº Q531152 ★★
Sem ofertas
-
R
Reverse mathematics
Branch of mathematical logic
Nº Q2005236 ★
Sem ofertas
-
Interseção
Ponto de convergência entre conjuntos, expresso matematicamente pelo símbolo ∩
Nº Q185837 ★★★
Sem ofertas
-
P
Programação concorrente
Nº Q128392 ★★
Sem ofertas
-
F
Forma lógica
Nº Q6667497 ★
Sem ofertas