NAND logic

Logic constructed only from NAND gates

The NAND Boolean function has the property of functional completeness. This means that any Boolean expression can be re-expressed by an equivalent expression utilizing only NAND operations. For example, the function NOT(x) may be equivalently expressed as NAND(x,x).

Nº Q4116068 ★★

Incomum · Saberes

NAND logic

Logic constructed only from NAND gates

Texto em inglês

The NAND Boolean function has the property of functional completeness. This means that any Boolean expression can be re-expressed by an equivalent expression utilizing only NAND operations. For example, the function NOT(x) may be equivalently expressed as NAND(x,x).

Último preço

—

Preço mínimo

—

Mediana 7 d

—

Vendas 30 d

0

Faixa 30 d

—

Em circulação

0

Cotação

Ver tabela
Datamediana MínMáxvendas

Histórico de vendas

Última venda
—
Média 30 d
—
Mínima 30 d
—
Máxima 30 d
—
Vendas 7 d
0
Vendas 30 d
0

Ainda sem vendas.

Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

The NAND Boolean function has the property of functional completeness. This means that any Boolean expression can be re-expressed by an equivalent expression utilizing only NAND operations. For example, the function NOT(x) may be equivalently expressed as NAND(x,x). In the field of digital electronic circuits, this implies that it is possible to implement any Boolean function using just NAND gates. The mathematical proof for this was published by Henry M. Sheffer in 1913 in the Transactions of the American Mathematical Society (Sheffer 1913). A similar case applies to the NOR function, and this is referred to as NOR logic.

Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Inductiveload (Public domain) ·

Cartas próximas

Ver a ficha

Confirmação