Was recast in 1928 at the Bologna International Congress as three questions: "He posed three questions: i.e. #1: Was mathematics complete? #2: Was mathematics consistent? #3: Was mathematics decidable?"

A.D. 1540

1853 purchase of southern Arizona and New Mexico by the US from Mexico. ~30,000 acres. $10 million.

The Sioux and Cheyenne destroyed Custer's army at Little Bighorn in 1876. East of Billings and north of Sheridan

A fortified Roman border encompassing southwest Germany. Follow the Rhine south from the Netherlands until Mainz, then take the Main river to the Donau (Danube) at Regensburg via the Regnitz through Nürnberg and the Main-Donau Kanal. Romans ruled the southern partition

a community-operated irrigation system that uses ditches, dams, and water gates to manage water distribution

The first Roman emperor

James Clerk Maxwell in 1867 developed the theory of electromagnetism, which predicted the existence of radio waves, electromagnetic waves much slower in frequency and longer in wave length than light.

Heinrich Hertz in 1887

Nerva, Trajan, Hadrian, Antoninus Pius, and Marcus Aurelius

Around 103 AD wrote highly of the "noble savage Germans." Known for notorious quote that Germans were "not mixed at all with other races," all having the same physical appearance: blue eyes, red/blonde hair, and huge frames.

The 1960s

The problem asks for an algorithm that considers, as input, a statement and answers "yes" or "no" according to whether the statement is universally valid, i.e., valid in every structure. By the completeness theorem of first-order logic, a statement is universally valid if and only if it can be deduced using logical rules and axioms. The problem was posed in 1928 by David Hilbert and Wilhelm Ackermann. It was answered in the negative by Alonzo Church and Alan Turing in independent papers in 1936.

Essentially a concentration camp of displaced Navajo and Mescalero Apache people at Fort Sumner, NM

The problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Turing reduced the question of the existence of an 'algorithm' or 'general method' able to solve the Entscheidungsproblem to the question of the existence of a 'general method' which decides whether any given Turing machine halts or not (the halting problem). If 'algorithm' is understood as meaning a method that can be represented as a Turing machine, and with the answer to the latter question negative (in general), the question about the existence of an algorithm for the Entscheidungsproblem also must be negative (in general).

Augustus' step-son who invaded Germany in the 10s and 00s BC. Stopped when reaching the Elbe.

The Gauls

The proverbial north-south border within Germany

Horace Greeley

Julius Caesar in the 50s BC deemed everything east of the Rhine "German", while the West, more friendly to Romanization, lied the Gauls

They were all settled by the Romans as launching points eastward across the Rhine to conquer Germany

9 AD ambush and decimation of Roman troops attempting to quash a rebellion purported by the German Hermann/Arminius to be happening Almost every Roman foothold east of the Rhine was destroyed in the aftermath.

Church proved that there is no computable function which decides, for two given λ-calculus expressions, whether they are equivalent or not. He relied heavily on earlier work by Stephen Kleene.

Built on the banks of the South Platte in 1838 as a trading post by Lieutenant Lancaster Lupton who resigned from the military a year prior. Closed in 1844 due to a particularly harsh blizzard.

Stephen Cook in 1971 and Leonid Levin in 1973

a native chief or leader