### Tim Ng

Shared publicly -I'd like to see this done for Indian cuisines.

The links between different regional cuisines in China become clear when recipes and ingredients are viewed as a kind of web, say computer scientists

1

Add a comment...

Start a hangout

Tim Ng

Attends Queen's University

Lives in Kingston, ON

248 followers|56,908 views

AboutPosts+1's

I'd like to see this done for Indian cuisines.

The links between different regional cuisines in China become clear when recipes and ingredients are viewed as a kind of web, say computer scientists

1

Add a comment...

In the last week there have been a number of "cheap" improvements to Zhang's recent result that there are infinitely many pairs of primes of distance at most 70,000,000 apart; by modifying the "easy" part of his argument, this bound has been reduced to 63.374.611 (Lewko), 59.874.594 (Trudgian), and now 59.470.640 (Morrison).

Basically, what Zhang really shows is that if H is any set of 3,500,000 integers with the property that H avoids at least one residue class mod p for each prime p, then there are infinitely many translates of H that contain at least two primes, and hence there are infinitely many pairs of primes of distance at most diam(H) apart; all the above "easy" improvements come from being a little more clever as to how to select H. If you want to get a brief chance to claim the "world record" for the best bound on small prime gaps, this could be an opportunity. (Of course, the ultimately more interesting challenge is to improve the 3,500,000 in Zhang's result, preferably with some powerful new ideas...)

Basically, what Zhang really shows is that if H is any set of 3,500,000 integers with the property that H avoids at least one residue class mod p for each prime p, then there are infinitely many translates of H that contain at least two primes, and hence there are infinitely many pairs of primes of distance at most diam(H) apart; all the above "easy" improvements come from being a little more clever as to how to select H. If you want to get a brief chance to claim the "world record" for the best bound on small prime gaps, this could be an opportunity. (Of course, the ultimately more interesting challenge is to improve the 3,500,000 in Zhang's result, preferably with some powerful new ideas...)

1

Add a comment...

more twitter bots

After the incredible success of @SomeHonMembers, I decided to create @HonSpeakerBot, which was not nearly as popular, but whatever. The lack of any transcripts or any data made a bot for #TOpoli diffi...

1

Add a comment...

Why secure hashing algorithms are not secure for passwords:

http://arstechnica.com/security/2012/08/passwords-under-assault/4/

Remember to use a hashing algorithm meant for**passwords**.

And don't forget to add a pinch of salt.

http://arstechnica.com/security/2012/08/passwords-under-assault/4/

Remember to use a hashing algorithm meant for

And don't forget to add a pinch of salt.

1

Add a comment...

this is pretty neat and likely useful: a database of descriptional complexity results for languages and operations

About DesCo hide. Descriptional complexity studies the measures of complexity of languages and operations. Usually, the descriptional complexity of an object is its shortest description which can be a...

1

Add a comment...

Python:

"foobar"[::] = "foobar"

"foobar"[0:6:] = "foobar"

"foobar"[0:6:1] = "foobar"

"foobar"[0:6:-1] = ""

"foobar"[6:0:-1] = "raboo"

"foobar"[7:0:-1] = "raboo"

"foobar"[::-1] = "raboof"

"foobar"[::] = "foobar"

"foobar"[0:6:] = "foobar"

"foobar"[0:6:1] = "foobar"

"foobar"[0:6:-1] = ""

"foobar"[6:0:-1] = "raboo"

"foobar"[7:0:-1] = "raboo"

"foobar"[::-1] = "raboof"

1

Add a comment...

Our colleagues in Theoretical Computer Science have decided to start their own seminar series inspired by Q+ called TCS+. Note, this is theoretical computer science in general, not just quantum. We wish them the best of luck and hope that this model spreads to many other subjects. If you are interested, join the TCS+ community, read the announcement http://mycqstate.wordpress.com/2013/01/27/tcs-online-seminars/ and visit their website plustcs

1

Add a comment...

fun with graphs

1

Interesting analysis, Tim! Rob Ford is losing his supporters faster than I thought.

Add a comment...

I was talking about those 'reals are countable' crazy people with a friend just the other day. This is in the same vein.

The Blog of Scott Aaronson Quantum computers are not known to be able to solve NP-complete problems in polynomial time, and can be simulated classically with exponential slowdown. « U. of Florida CS d...

1

Add a comment...

Work

Occupation

Theoretical computer scientist and pretend mathematician

Places

Currently

Kingston, ON

Previously

Toronto, ON - London, ON - Waterloo, ON

Links

YouTube

Other profiles

Education

- Queen's UniversityPhD (Computer Science), 2013 - present
- University of Western OntarioMSc (Computer Science, Theory), 2011 - 2013
- University of WaterlooBMath (Computer Science & Pure Mathematics), 2006 - 2011

Basic Information

Gender

Male

Tim Ng's +1's are the things they like, agree with, or want to recommend.

cubicle17 | a tumblelog cubicle17.com What I'm drinking tonight: a Bitter Mai Tai. And it's every bit as delicious as it looks…maybe more. Bitter Mai Tai (via Jeremy Oert |

Twitter bots, twitter bots, twitter bots, folks | tim ng timng.ca After the incredible success of @SomeHonMembers, I decided to create @HonSpeakerBot, which was not nearly as popular, but whatever. The lack |

Toronto City Council, 2012 | tim ng timng.ca 2012 has been a hell of a year, especially if you're into the city council scene in Toronto. Basically, the year in Toronto politics can be |

ongoing by Tim Bray · DMR, 1941—2011 www.tbray.org DMR, 1941—2011. Search. Some things we now know to be good ideas: Writing operating systems in a compiled machine-independent language. Perf |

Programming Language Checklist colinm.org Programming Language Checklist by Colin McMillen, Jason Reed, and Elly Jones. You appear to be advocating a new: [ ] functional [ ] imperati |