Search NKS | Online
671 - 680 of 744 for Do
To do this explicitly for all possible p that can occur would however entail having infinitely many new rules.
But on its own this would do me little good—for I need to represent not only traditional mathematics, but also more general rules and programs, as well as procedures and algorithms.
An optimal method for doing this was then found by David Huffman in 1951.
Outdoor security systems also often need ways to distinguish animals and wind-induced motion from intentional human activity—and tend to have fairly simple procedures for doing this.
And in a moral theory of law this can be understood in my approach as a consequence of the computations they do being less sophisticated—so that their outcome is less free of the environment and of their underlying rules.
In most cases, the idea is recursively to divide data into parts, then to do operations on these parts, and finally reassemble the results.
But all this actually does is to force there to be only two objects analogous to True and False .)
The analog of doing a long computation to find a result is having to go to large values of variables to find a positive polynomial value.
Nevertheless, if one considers minors a finite list does suffice—though for example on a torus it is known that at least 800 (and perhaps vastly more) are needed.
Sometimes it was said that this must reflect the presence of a point mass, but soon it was typically just said to be a point at which the Einstein equations—for whatever reason—do not apply. … (There are alternative and seemingly inelegant theories of gravity that work differently—and notably do not yield black holes.