[see also: rotation]
A turn through $\pi/3$ restores the position of the needle.
The algorithm compares $x$ with each entry in turn until a match is found or the list is exhausted.
The orbits of $H$ on $B$ are unions of orbits of $N$ on $G$, which in turn are orbits of $N$ on $G_1$, $G_2$ and $G_3$.
[see also: proceed, change into, make into, transform, appear, go back, transpire]
We now turn to a brief discussion of another concept which is relevant to John's theorem.
We now turn to estimating $Tf$.
Implementation is the task of turning an algorithm into a computer program.
We turn the set of ...... into a category by defining the morphisms to be ......
We now turn back to our main question.
It turns out that $A$ is not merely symmetric, but actually selfadjoint.
This condition also turns out to be necessary.
However, this equality turned out to be a mere coincidence.
Our main finding in this paper is that this intuition turns out to be erroneous.
It should come as no surprise that a condition like $a_i\ne b_i$ turns up in this theorem. [= appears]
Go to the list of words starting with: a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
y
z