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 Theorists
Famous quotes containing the word approaches:
“A politician is a statesman who approaches every question with an open mouth.”
—Adlai Stevenson (1900–1965)