Раменское, однако..

[anhinga_anhinga]

people say it really looks like this:
http://boooms.livejournal.com/30095.html

a large collection of these photos (traffic):
http://sturman.livejournal.com/271320.html?thread=1433560#t1433560

В середине 2000-х годов в Раменском был реализован проект по художественному оформлению группы типовых жилых домов, весьма необычный для России. В центре города было установлено много разнообразных скульптур, некоторые из них созданы по мотивам советских мультфильмов.

Comments

[cema.livejournal.com]

In order to fix the compiler, of course! ;-)

[anhinga-anhinga.livejournal.com]

In Standard ML the problem is decidable, it's just that the worst case is that the derived type is exponential in the length of the program (as a directed acyclic graph, and double exponential as linear output).

So one needs a bit less than Turing oracle to fix the compiler, at least for Standard ML ;-) Some other type systems are actually undecidable.

But at the same time, I am not sure that Turing oracle by itself can be used to reduce the complexity of the computation involved to make it fit a real computer -- I am just not familiar enough with the theory of computations with such oracles.. For example, if one uses such an oracle in a straightforward way, as applied to this problem, the oracle always says "yes" (a large enough computer will always complete type inference of a Standard ML program given enough time), and this does not help us to reduce the resources needed to figure out the outcome of the type inference process.

[anhinga-anhinga.livejournal.com]

Actually, it is possible to use the Turing oracle to determine whether the outcome of a program is a particular value: one just modifies the program to loop after any other outcome, and applies the oracle..