`` We think the governor treated us rather shabbily, to say the least of it.

We often say of a person that he `` looks young for his age '' or `` old for his age ''.

We may say of some unfortunates that they were never young.

We cannot truthfully say of anyone who has succeeded in entering deep into his sixties that he was never old.

We sympathize with Mr. Kennedy, but we feel bound to say that his budget review doesn't please us either, although for very different reasons.

We couldn't be seen together, for the tongue of Scandal was ever ready to link our names, and the tongue of Scandal finds but one thing to say of the association of a man with a girl, no matter how innocent.

We say that N is nilpotent if there is some positive integer R such that Af.

We may say that his problem was diagnosed but that he refused treatment.

We may say that his attitude was foolish, since he may have been a success had he learned some human relations skills ; ;

We should say that we made our point with feeling the first time and little or no feeling the second time, but that it was the same point we were making.

We may carry this sequence one step further and say that at seventy he was a poet at the height of his powers, wanting only the impetus of two tragedies, one personal, the other national, to loose those powers in poetry.

`` We worry '', say the mothers.

We have to tell ourselves that when Parker spoke in this vein, he believed what he said, because he could continue, `` But the truth, which cost me bitter tears to say, I must speak, though it cost other tears hotter than fire ''.

We do not say that a man who takes no interest in politics is a man who minds his own business ; we say that he has no business here at all.

We say A is unital if it contains an element 1 such that

We can say that that relation has being as well.

We say we want to see put on the statute book something which will make our people citizens of the world before they are citizens of this country ".

We might not see any rotation initially, but if we closely look at the right, we see a larger field at, say, x = 4 than at x = 3.

We say that the mutation is recessive because the organism will exhibit the wild type phenotype ( ordinary trait ) unless both chromosomes of a pair have the mutation ( homozygous mutation ).

We say that f is a diffeomorphism if it is bijective, smooth, and if its inverse is smooth.

We can distort a dual polyhedron such that it can no longer be obtained by reciprocating the original in any sphere ; in this case we can say that the two polyhedra are still topologically dual.

We have to also say how to add their elements.

We can use it as basis to say, " a < b " and " b > a ", two judgments which designate the same state of affairs.

: “ We say that it origin of the traditions is polar, and the pole is nomore Western than it is Eastern.

We could, alternatively, choose an encoding for Turing machines, where an encoding is a function which associates to each Turing Machine M a bitstring < M >.

We can only study their behavior ( i. e., by giving them our own Turing test ).

We know that we can decide membership of H < sub > f </ sub > by way of a deterministic Turing machine that first calculates f (| x |), then writes out a row of 0s of that length, and then uses this row of 0s as a " clock " or " counter " to simulate M for at most that many steps.

We can further describe Turing machines that will eventually halt and give an answer for any input in a language, but which may run forever for input strings which are not in the language.

We can then construct another Turing machine that simulates the operation of this machine, along with simulating directly the execution of the machine given in the input as well, by interleaving the execution of the two programs.

We say is Turing equivalent to and write if both and The equivalence classes of Turing equivalent sets are called Turing degrees.

:"< sup >†</ sup > We shall use the expression ' computable function ' to mean a function calculable by a machine, and let ' effectively calculable ' refer to the intuitive idea without particular identification with any one of these definitions.

' We may take this literally, understanding that by a purely mechanical process one which could be carried out by a machine.

The Why We Fight Series depicts the Nazi propaganda machine.

At the time of his Guild of Handicraft, initiated in 1888, he said, " We do not reject the machine, we welcome it.

* Fringe episode " The Day We Died " ( 2011 ): Peter travels to this year when entering a machine.

We aren't really interested in whether a problem can be solved quickly on a parallel machine.

We beat the hell out of a machine.

We can trace Isaac Singer of sewing machine fame here in 1837, when he was better known for his acting than his machinery skills.

IBM returned to Livermore and stated that they were withdrawing from the contract, and instead proposed a dramatically better system, " We are not going to build that machine for you ; we want to build something better!

We estimated that the machine could be put in condition for flight again in about a day or two.

We do this by constructing a machine which cannot be in TIME ( f ( n )), by diagonalization.

We then show that the machine is in TIME ( g ( n )), using a simulator machine.

We thus conclude that the machine K does not exist, and so

John R. Searle does not elucidate the terms strong and weak in his book The Construction of Social Reality, but he clearly uses them in his Chinese room argument, where he debates the feasibility of creating a computing machine with a sharable understanding of reality, and he adds " We are precisely such machines.

" Memory card attacks are a real threat: We determined that anyone who has access to a memory card of the AV-OS, and can tamper it ( i. e. modify its contents ), and can have the modified cards used in a voting machine during election, can indeed modify the election results from that machine in a number of ways.

We especially refer to the apparently autonomous and intelligent, chaotically mercurial and mischievous machine elves encountered in the trance state, strange teachers whose marvelous singing makes intricate toys out of the air and out of their own continually transforming body geometries.

We know, therefore, that this language cannot be accepted correctly by any finite state machine, and is thus not a regular language.

We, along with many other magazines, were shown the machine in locked hotel rooms.