In other words, nationalism worked well enough when it had limited application, both as to geography and as to population ; ;

But because it is the function of the mind to turn the one into the other by means of the capacities with which words endow it, we do not unwisely examine the type of distinction, in the sphere of politics, on which decisions hang.

by this term he means to ridicule their professions of acting in the interest of the Church despite their own education and manner of life -- a gibe, in other words, at the `` Presbyterianism '' in Harley's family and at Bolingbroke's reputed impiety.

Once more, in other words, Steele is said to be indebted to Swift for his `` wit '' ; ;

In other words, as students go through college, those who are most successful academically tend to become more committed to a `` Bill of Rights '' orientation.

in other words its existence belongs to the period of Roman Britain.

The problem, in other words, is strictly a chronological one.

In other words, atrocities by savages wearing the uniform of the central government might be condoned, had the victims been serving the cause of dissident Katanga.

In other words, the Secretary General is to be a nonpartisan, international servant, not a political, national one.

In other words, the whole storage and pipeline system does not belong to the homeowners nor to the town but rather to Tri-State.

Poster Products Inc., Chicago, Ill.: a changeable copy and display sign which consists of an extruded impact styrene background in choice of colors, onto which are mounted snap-in letters, figures, or words screened on acetate or other types of sheet stock.

In other words, if an ideal gas is compressed and kept at constant temperature, the work done in compressing it is completely converted into heat and transferred to the surrounding heat sink.

In other words, the anastomoses between the bronchial artery and pulmonary artery should be considered as functional or demand shunts.

In other words, if F satisfies the differential equation Af, then F is uniquely expressible in the form Af where Af satisfies the differential equation Af.

In other words, these curves have only fixed intersections common to them all.

But if no two lines of the regulus of multiple secants of **zg can intersect, then the regulus must be quadratic, or in other words, **zg must be either a Af or a Af curve on a nonsingular quadric surface.

In the urban area, in other words, they, unlike some urban ethnic groups, do not concentrate in ghetto colonies.

In other words, the Soviet Union was determined to create a Poland so strong as to be a powerful bulwark against Germany and so closely tied to Russia that there would never be any question of her serving as a cordon sanitaire against the Soviets or posing as an independent, balancing power in between Russia and Germany.

In other words the burden of pleading clearly rested upon the pleader by state law.

It will not, however, be used for symbolic assignment until all other index words or electronic switches have been assigned for the first time.

In other words, like automation machines designed to work in tandem, they shared the same programming, a mutual understanding not only of English words, but of the four stresses, pitches, and junctures that can change their meaning from black to white.

Even less regard for mom and mom's apple pie goes with: Af In other words, the way the speaker relates to mother is clearly indicated.

In other words, the promulgators of the murder plan made clear that physically exterminating the Jews was but an extension of the anti-Semitic measures already operating in every phase of German life, and that the new conspiracy counted on the general anti-Semitism that had made those measures effective, as a readiness for murder.

Although it was at the Battle of The Little Horn, about which more words have been written than any other battle in American history, that the 7th Cavalry first made its mark in history, the regiment was ten years old by then.

This topic was further developed in the 1930s by Alonso Church and Alan Turing, who on the one hand gave two independent but equivalent definitions of computability, and on the other gave concrete examples for undecidable questions.

But other thinkers sympathetic to his basic argument have suggested that the necessary ( though perhaps still not sufficient ) extra conditions may include the ability to pass not just the verbal version of the Turing test, but the robotic version, which requires grounding the robot's words in the robot's sensorimotor capacity to categorize and interact with the things in the world that its words are about, Turing-indistinguishably from a real person.

: Alan Turing ( writing 30 years before Searle presented his argument ) noted that people never consider the problem of other minds when dealing with each other.

He has received various other awards including the Turing Award, the National Medal of Science, the John von Neumann Medal, and the Kyoto Prize.

Considered as an abstract model of computation, the finite state machine is weak ; it has less computational power than some other models of computation such as the Turing machine.

" Unfortunately neither Dahl, nor Nygaard could make it to the ACM Turing Award Lecture, scheduled to be delivered at the OOPSLA 2002 conference in Seattle, as they both died within two months of each other

Aside from a Turing machine, other equivalent ( See: Church – Turing thesis ) models of computation are in use.

A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine ( UTM, or simply a universal machine ).

In colloquial usage, the terms " Turing complete " or " Turing equivalent " are used to mean that any real-world general-purpose computer or computer language can approximately simulate any other real-world general-purpose computer or computer language, within the bounds of finite memory – they are linear bounded automaton complete.

The Church – Turing thesis states that this is a law of mathematics — that a universal Turing machine can, in principle, perform any calculation that any other programmable computer can.

A computer with access to an infinite tape of data is sometimes more powerful than a Turing machine, because the tape can in principle contain the solution to the halting problem, or some other undecidable problem.

Two other versions exist, Object-Oriented Turing and Turing Plus, a systems programming variant.

* Since NP-complete problems transform to each other by polynomial-time many-one reduction ( also called polynomial transformation ), all NP-complete problems can be solved in polynomial time by a reduction to H, thus all problems in NP reduce to H ; note, however, that this involves combining two different transformations: from NP-complete decision problems to NP-complete problem L by polynomial transformation, and from L to H by polynomial Turing reduction ;

In other words, a problem X is NP-easy if and only if there exists some problem Y in NP such that X is polynomial-time Turing reducible to Y.

# A recursively enumerable language is a formal language for which there exists a Turing machine ( or other computable function ) which will enumerate all valid strings of the language.

# A recursively enumerable language is a formal language for which there exists a Turing machine ( or other computable function ) that will halt and accept when presented with any string in the language as input but may either halt and reject or loop forever when presented with a string not in the language.

However, the university has also contributed in other fields, such as by the work of mathematicians Paul Erdős, Horace Lamb and Alan Turing ; author Anthony Burgess ; philosophers Samuel Alexander, Ludwig Wittgenstein and Alasdair MacIntyre ; the Pritzker Prize and RIBA Stirling Prize winning architect Norman Foster and composer Peter Maxwell Davies all attended, or worked in, Manchester.

Systems explored in the book include cellular automata in one, two, and three dimensions ; mobile automata ; Turing machines in 1 and 2 dimensions ; several varieties of substitution and network systems ; primitive recursive functions ; nested recursive functions ; combinators ; tag systems ; register machines ; reversal-addition ; and a number of other systems.