Though not directly related to the numerical interpretation of binary symbols, sequences of bits may be manipulated using logical connective.

A remarkable theorem due to Gregory Chaiten shows that if there is a minimal program with binary symbols, there is at most about one such minimal -bit symbol sequences.

Information capacity is a dimensionless quantity, because it refers to a count of binary symbols.

When digital computers became widely used in the early 50s, this argument was extended to suggest that the brain was a vast physical symbol system, manipulating the binary symbols of zero and one.

It encodes binary symbols, which keeps the complexity low and allows probability modelling for more frequently used bits of any symbol.

In computer jargon, each of these binary symbols, either 0 or 1, is known as a bit (a contraction of 'binary digit').

Now, a well-known area of computer science considers how redundant a program is; for example, a simple redundancy would duplicate each binary symbol.

These data are stored as binary symbols (1s and 0s).

From their studies a genetic map was made of his chromosomes, every allele and allomorph in place, and coded into binary symbols which were stamped on his collar.

To model this idea, binary symbols can be used to mark the spikes: 1 for a spike, 0 for no spike.