Skip to main content
 

How Long It Takes Kids to Read Popular Books #Infographic

A children's book retailer offers a look at the average times it takes kids to complete a range of classic children's titles. It bears mentioning that the figures in this infographic don't represent data from an empirical study, just the average reading speed per grade level calibrated to the various lengths of the books included. Still, it's a helpful gauge of the various time commitments reading content demands of young readers who are increasingly distracted by other media.

 
 
 
 
 

Teaching problem solving | Work in Pencil

Comparing some interesting problem solving methods

 
 
 
 

2015: The year of Quantum Computing | Ilyas Khan

Great overview of quantum computing with some good references.

 

Stack Overflow Developer Survey 2015

Some interesting data on programmers/developers, pay, location, gender, satisfaction, etc/

 
 

In a Search for a Structure, Part 1: On Entropy. Category theory is the appropriate language for describing entropy.

Mathematics is about ”interesting structures”. What make a structure interesting is an abundance of interesting problems; we study a structure by solving these problems.
The worlds of science, as well as of mathematics itself, is abundant with gems (germs?) of simple beautiful ideas. When and how may such an idea direct you toward beautiful mathematics?
I try to present in this talk a few suggestive examples.

 

Physics, Topology, Logic and Computation: A Rosetta Stone #categorytheory

arXiv:0903.0340 [quant-ph]
In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology: namely, a linear operator behaves very much like a "cobordism". Similar diagrams can be used to reason about logic, where they represent proofs, and computation, where they represent programs. With the rise of interest in quantum cryptography and quantum computation, it became clear that there is extensive network of analogies between physics, topology, logic and computation. In this expository paper, we make some of these analogies precise using the concept of "closed symmetric monoidal category". We assume no prior knowledge of category theory, proof theory or computer science.
, ,

 

‘Sleeping beauty’ papers slumber for decades #complexity

Interesting statistics on sleeping papers. There are some cool things going on here...