ded_maxim: (Default)
ded_maxim ([personal profile] ded_maxim) wrote2006-03-01 03:53 pm

Пуанкаре о теоремах и колбасе

Thus, be it understood, to demonstrate a theorem, it is neither necessary nor even advantageous to know what it means....[A] machine might be imagined where the assumptions were put in at one end, while the theorems came out at the other, like the legendary Chicago machine where the pigs go in alive and come out transformed into hams and sausages. No more than these machines need the mathematician know what he does.

[identity profile] ded-maxim.livejournal.com 2006-03-01 11:32 pm (UTC)(link)
Precisely -- nice-looking assumptions are supposed to lead consistently to nice-looking theorems.