Reunión de la Junta Consultiva Internacional de la Universidad de los Andes, en 1952 en Princeton (New Jersey). En la foto Mario Laserna, fundador de Los Andes, y miembros de la Junta, entre otros, Albert Einstein. En la parte de atrás, el célebre profesor John Von Neumann (padre de los computadores, pionero de la teoría de juegos y uno de los cerebros más creativos de la historia de la humanidad), quien entró a hacer parte de la Junta en 1952.— at Princeton, New Jersey.

Roughly: “Meeting of the International Advisory Board of the University of the Andes in 1952 in Princeton (New Jersey). In the photo Mario Laserna, founder of Los Andes, and members of the Board, among others, Albert Einstein. In the back, the celebrated Professor John von Neumann (the father of computers, a pioneer of game theory and one of the most creative minds in the history of mankind), who joined the Board in 1952. – at Princeton, New Jersey.”

(Found at the Facebook thing. I was an undergrad at the Andes ages ago.)

[Now to make this more than perfect, I would only need a picture of the meeting of Leonel Parra, my first Calculus teacher, with Borges. They talked about infinity, of course.]

43.614000-116.202000

Like this:

LikeLoading...

Related

This entry was posted on Monday, April 9th, 2012 at 10:08 am and is filed under People. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

(1) Patrick Dehornoy gave a nice talk at the Séminaire Bourbaki explaining Hugh Woodin's approach. It omits many technical details, so you may want to look at it before looking again at the Notices papers. I think looking at those slides and then at the Notices articles gives a reasonable picture of what the approach is and what kind of problems remain […]

It is not possible to provide an explicit expression for a non-linear solution. The reason is that (it is a folklore result that) an additive $f:{\mathbb R}\to{\mathbb R}$ is linear iff it is measurable. (This result can be found in a variety of places, it is a standard exercise in measure theory books. As of this writing, there is a short proof here (Intern […]

I learned of this problem through Su Gao, who heard of it years ago while a post-doc at Caltech. David Gale introduced this game in the 70s, I believe. I am only aware of two references in print: Richard K. Guy. Unsolved problems in combinatorial games. In Games of No Chance, (R. J. Nowakowski ed.) MSRI Publications 29, Cambridge University Press, 1996, pp. […]

Let $C$ be the standard Cantor middle-third set. As a consequence of the Baire category theorem, there are numbers $r$ such that $C+r$ consists solely of irrational numbers, see here. What would be an explicit example of a number $r$ with this property? Short of an explicit example, are there any references addressing this question? A natural approach would […]

Suppose $M$ is an inner model (of $\mathsf{ZF}$) with the same reals as $V$, and let $A\subseteq \mathbb R$ be a set of reals in $M$. Suppose further that $A$ is determined in $M$. Under these assumptions, $A$ is also determined in $V$. The point is that since winning strategies are coded by reals, and any possible run of the game for $A$ is coded by a real, […]

The two concepts are different. For example, $\omega$, the first infinite ordinal, is the standard example of an inductive set according to the first definition, but is not inductive in the second sense. In fact, no set can be inductive in both senses (any such putative set would contain all ordinals). In the context of set theory, the usual use of the term […]

I will show that for any positive integers $n,\ell,k$ there is an $M$ so large that for all positive integers $i$, if $i/M\le \ell$, then the difference $$ \left(\frac iM\right)^n-\left(\frac{i-1}M\right)^n $$ is less than $1/k$. Let's prove this first, and then argue that the result follows from it. Note that $$ (i+1)^n-i^n=\sum_{k=0}^{n-1}\binom nk i^ […]

I think it is cleaner to argue without induction. If $n$ is a positive integer and $n\ge 8$, then $7n$ is both less than $n^2$ and a multiple of $n$, so at most $n^2-n$ and therefore $7n+1$ is at most $n^2-n+1

Let PRA be the theory of Primitive recursive arithmetic. This is a subtheory of PA, and it suffices to prove the incompleteness theorem. It is perhaps not the easiest theory to work with, but the point is that a proof of incompleteness can be carried out in a significantly weaker system than the theories to which incompleteness actually applies. It is someti […]

¿Andrés es posible utiizar esta foto para http://www.elespectador.com con el crédito respectivo?

Leonardo, encontré la foto en la página de Facebook de Los Andes. Debes preguntarle a ellos.