Permanent link -
Posted 13 days ago (via andrewgelman.com)

Someone pointed me to this article, “The more you play, the more aggressive you become: A long-term experimental study of cumulative violent video game effects on hostile expectations and aggressive behavior,” by Youssef Hasan, Laurent Bègue, Michael Scharkow, and Brad Bushman. My correspondent was suspicious of the error bars in Figure 1. I actually think […]
The post More bad ...

Permanent link -
Posted 14 days ago (via blog.computationalcomplexity.org)

Recall that in a prior post I asked
Is there an NFA for { ay : y ≠ 1000 } with substantially less than 1000 states.
I will now show that any NFA for this set requires 999 states, so essntially 1000. The proof uses Ramsey Theory. I will tell you the little bit of Ramsey Theory that you need.
NO- the above is false.
There is an NFA with 60 states. I have a complete exposition her...

Permanent link -
Posted 14 days ago (via flowingdata.com)

One way to think about gender pay gap is to imagine women receive…Tags: calendar, Guardian, pay gap...

Permanent link -
Posted 14 days ago (via hilbertthm90.wordpress.com)

As I pointed out when I started the series, I was woefully ignorant of the mystery genre. I picked up Agatha Christie’s Murder on the Orient Express from the library. Something surprised me about it. It was far along in a row of books that all looked the same. This is actually the 10th book in the … Continue reading Year of Mystery Novels, Part 3: Murder on the Orient Express...

Permanent link -
Posted 14 days ago (via blog.computationalcomplexity.org)

(Added later- a reader left a comment pointing to a paper with the answer and saying that the problem is not original. My apologies- upon rereading I can see why one would think I was claiming it was my problem. It is not. I had heard the result was folklore but now I have a source! So I thank the commenter and re-iterate that I am NOT claiming it is my problem.)
Consider the language
{L = ...

Permanent link -
Posted 14 days ago (via blog.computationalcomplexity.org)

I have been playing with a new complexity class AFQP, defined in a yet-to-be-published manuscript by Alagna and Fleming. A language L is in AFQP if there is a polynomial-time quantum Turing machine Q such that for all inputs x,If x is in L, then Q(x) accepts with high probability.If x is not in L, then Q(x) rejects with high probability.Q(x) only has O(log |x|) quantumly entangled bits as well as ...

Permanent link -
Posted 14 days ago (via yetanothermathblog.com)

In these notes on ring theory, I tried to cover enough material to get a feeling for basic ring theory, via cyclic codes and ring-based cryptosystems such as NTRU. Here’s a list of the topics. 1 Introduction to rings 1.1 Definition of a ring 1.2 Integral domains and fields 1.3 Ring homomorphisms and ideals 1.4 […]...

Permanent link -
Posted 14 days ago (via yetanothermathblog.com)

In these notes, I tried to cover enough material to get a feeling for “calculus on graphs”, with applications to sports rankings and the Friendship Theorem. Here’s a list of the topics. 1 . Introduction 2. Examples 3. Basic definitions 3.1 Diameter, radius, and all that 3.2 Treks, trails, paths 3.3 Maps between graphs 3.4 […]...

Permanent link -
Posted 14 days ago (via junkcharts.typepad.com)

Kaiser Fung, founder of Principal Analytics Prep, reacts to the revelation about the amount of private data collected by Google and Facebook....

Permanent link -
Posted 14 days ago (via flowingdata.com)

Alec Barrett for TWO-N describes the benefits and some of the intricacies of…Tags: animation, transitions...