An aggregation of some of the math blogs that I follow.

Math News: Items from date 2012-05-09 (1 - 6 of about 6) (xml) (Feedlist)

## What is Homotopy Type Theory Good For?The n-Category Café

(10.05.2012 02:03h)

The current situation of homotopy type theory reminds me a bit of the dot-com bubble at the turn of the millenium. Back then a technology had appeared which was as powerful as it was new: while everybody had a sure feeling that the technology would have dramatically valuable impact, because it was so new nobody had an actual idea of what that would be. As opposed to other bubbles, that one did not burst because overly optimistic hopes had been unjustifed as such, but because it took a while to understand just how these hopes would be materialized in detail ... [Link]

## Waterman behind the scenes! Partying hard with the National Science BoardScott

(09.05.2012 15:11h)

A few months ago, I got a surprise call from Subra Suresh, director of the National Science Foundation, who told me I was going to share this year’s Alan T. Waterman Award with Robert Wood of Harvard. At first I assumed it was a telemarketing call, since pretty much no one calls my office phone; I use my iPhone exclusively and have trouble even operating my desk phone. Dr. Suresh explained that this was the first time the Waterman would ever be awarded to two people the same year, but that the committee was unanimous in supporting both me and ... [Link]

## The Quantum Fault-Tolerance Debate UpdatesGil Kalai

(09.05.2012 13:50h)

In a couple of days, we will resume the debate between Aram Harrow and me regarding the possibility of universal quantum computers and quantum fault tolerance. The debate takes place over GLL Godel’s Lost Letter and P=NP blog. The Debate Where were we? My initial post “Perpetual Motion of The 21st Century?” presented my conjectures regarding how noisy quantum computers and noisy quantum evolutions really behave. Aram’s first post was entitled “Flying Machines of the 21st Century?” It mainly dealt with the question “How is it possible that quantum fault-tolerance is impossible or really really hard while classical fault tolerance ... [Link]

## Lewis Carroll logic puzzlesTerence Tao

(09.05.2012 07:57h)

I had another long plane flight recently, so I decided to try making another game, to explore exactly what types of mathematical reasoning might be amenable to gamification. I decided to start with one of the simplest types of logical argument and one of the few that avoids the disjunction problem mentioned in the previous post , namely the Aristotelian logic of syllogistic reasoning, most famously exemplified by the classic syllogism: Major premise: All men are mortal. Minor premise: Socrates is a man. Conclusion: Socrates is a mortal. There is a classic collection of logic puzzles of Lewis Carroll from ... [Link]

## New version of algebra gameTerence Tao

(09.05.2012 07:57h)

Just a quick update on my previous post on gamifying the problem-solving process in high school algebra. I had a little time to spare on an airplane flight, of all things , so I decided to rework the mockup version of the algebra game into something a bit more structured, namely as 12 progressively difficult levels of solving a linear equation in one unknown. Requires either Java or Flash. Somewhat to my surprise, I found that one could create fairly challenging puzzles out of this simple algebra problem by carefully restricting the moves available at each level. Here is a ... [Link]

## Progressions of length 4 in finite field geometries revisitedNew bounds for Szemeredi’s theorem, Ia

(09.05.2012 04:54h)

Ben Green and I have just uploaded to the arXiv our paper “New bounds for Szemeredi’s theorem, Ia: Progressions of length 4 in finite field geometries revisited“, submitted to Proc. Lond. Math. Soc.. This is both an erratum to, and a replacement for, our previous paper “New bounds for Szemeredi’s theorem. I. Progressions of length 4 in finite field geometries“. The main objective in both papers is to bound the quantity for a vector space over a finite field of characteristic greater than , where is defined as the cardinality of the largest subset of that does not contain an ... [Link]

Archive:
Earlier
30.4.2012 2.5.2012 3.5.2012 4.5.2012 5.5.2012 6.5.2012 7.5.2012 8.5.2012 9.5.2012 10.5.2012 11.5.2012 13.5.2012 14.5.2012 16.5.2012 17.5.2012 19.5.2012 20.5.2012 21.5.2012 22.5.2012 24.5.2012 25.5.2012 26.5.2012 27.5.2012 28.5.2012 29.5.2012
Later

Generiert mit Parteibuch Aggregator 0.5.2