Recent Approaches and Subfields
The areas below date as such from no earlier than the mid-twentieth century, even if they are based on older material. For example, as is explained below, the matter of algorithms in number theory is very old, in some sense older than the concept of proof; at the same time, the modern study of computability dates only from the 1930s and 1940s, and computational complexity theory from the 1970s.
Read more about this topic: Number Theory
Other articles related to "recent approaches and subfields":
... There are two main questions "can we compute this?" and "can we compute it rapidly?" ... Anybody can test whether a number is prime or, if it is not, split it into prime factors doing so rapidly is another matter ...
Famous quotes containing the word approaches:
“Bloody men are like bloody buses
You wait for about a year
And as soon as one approaches your stop
Two or three others appear.”
—Wendy Cope (b. 1945)