**Not your profile?** Login and get free access to your reports and analysis.

## Tim Ng

Occupation: Theoretical computer scientist and pretend mathematician

Location: Kingston, ON

His ProfilesRankThis is the rank of 'Tim Ng' out of all Google+ Profiles (individuals).: 516,177 (GenderRankFor the gender 'Men'.: 322,264)

His ProfilesRankThis is the rank of 'Tim Ng' out of all Google+ Profiles (individuals). in Canada: 7,170 (GenderRankFor the gender 'Men'.: 4,801)

Followers: 253

Following: 205

Views: 11,956

Added to CircleCount.com: 10/14/2013That's the date, where Tim Ng has been indexed by CircleCount.com.

This hasn't to be the date where the daily check has been started. (Update nowYou can update your stats by clicking on this link!

This can take a few seconds.)

### Tags

No tag added here yet.

You can login on CircleCount to add some tags here.

Are you missing a tag in the list of available tags? You can suggest new tags here.

### Tim Ng has been shared in 1 public circles

Author | Followers | Date | Users in Circle | Comments | Reshares | +1 | Links | |
---|---|---|---|---|---|---|---|---|

Novina W | 1,842 | I was asked to share my #Toronto circle, so here it is. Add these people, spread the words about Google+ and let's get the local community going. And maybe we can all HIRL (Hangout In Real Life) sometimes or start a Toronto Photowalk, or just get together and talk about how the TTC sucks and we need more subway!! It takes a lot of effort to find people locally. I wish there's a way to more quickly find/sort people by geographical area (I have to literally go to people's About and hope they added their location in right now). I say something should be done about that, +Vic Gundotra! If I missed you and you want in on my Awesome Torontorian circle, leave a comment. :) | 2012-01-20 07:27:35 | 106 | 6 | 0 | 1 |

Top posts in the last 50 posts

### Most comments: 5

### Most reshares: 1

2013-07-17 10:21:14 (2 comments, 1 reshares, 0 +1s)

### Most plusones: 3

2012-04-09 03:23:19 (1 comments, 1 reshares, 3 +1s)

Anonymity on the internet is a very fragile thing; every anonymous online identity on this planet is only about 31 bits of information away from being completely exposed. This is because the total number of internet users on this planet is about 2 billion, or approximately 2^{31}. Initially, all one knows about an anonymous internet user is that he or she is a member of this large population, which has a Shannon entropy of about 31 bits. But each piece of new information about this identity will reduce this entropy. For instance, knowing the gender of the user will cut down the size of the population of possible candidates for the user's identity by a factor of approximately two, thus stripping away one bit of entropy. (Actually, one loses a little less than a whole bit here, because the gender distribution of internet users is not perfectly balanced.) Similarly, any tidbit of information about the... more »

Latest 50 posts

2013-07-31 08:34:41 (0 comments, 0 reshares, 1 +1s)

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

2013-07-17 10:21:14 (2 comments, 1 reshares, 0 +1s)

2013-06-10 15:58:03 (0 comments, 0 reshares, 0 +1s)

2013-06-03 15:21:38 (1 comments, 0 reshares, 1 +1s)

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"

2013-06-01 13:01:32 (0 comments, 0 reshares, 0 +1s)

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... more »

2013-01-30 03:57:11 (0 comments, 0 reshares, 0 +1s)

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

2012-10-30 13:35:11 (0 comments, 0 reshares, 0 +1s)

more twitter bots

2012-08-23 14:32:39 (0 comments, 0 reshares, 0 +1s)

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.

2012-07-10 15:14:40 (0 comments, 0 reshares, 0 +1s)

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

2012-05-02 16:27:57 (0 comments, 0 reshares, 0 +1s)

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

2012-05-02 02:49:28 (0 comments, 0 reshares, 0 +1s)

in case you were wondering http://timng.ca/blog/2012/05/01/making-nfas-smaller/

2012-04-27 13:44:30 (1 comments, 0 reshares, 0 +1s)

I defended against a #zergrush on Google Search.

2012-04-12 18:16:16 (0 comments, 0 reshares, 0 +1s)

An imaginative variation on the Turing Test and Eliza: a group has been deploying robots on Twitter in order to influence the tweet and following behaviour of target groups. Particularly fascinating: the bots were able to increase the interaction rates between other users.

Interesting throughout.

2012-04-11 18:34:19 (1 comments, 0 reshares, 0 +1s)

Wow, even the mobile interface got an update

2012-04-09 03:23:19 (1 comments, 1 reshares, 3 +1s)

Anonymity on the internet is a very fragile thing; every anonymous online identity on this planet is only about 31 bits of information away from being completely exposed. This is because the total number of internet users on this planet is about 2 billion, or approximately 2^{31}. Initially, all one knows about an anonymous internet user is that he or she is a member of this large population, which has a Shannon entropy of about 31 bits. But each piece of new information about this identity will reduce this entropy. For instance, knowing the gender of the user will cut down the size of the population of possible candidates for the user's identity by a factor of approximately two, thus stripping away one bit of entropy. (Actually, one loses a little less than a whole bit here, because the gender distribution of internet users is not perfectly balanced.) Similarly, any tidbit of information about the... more »

2012-02-28 17:08:03 (0 comments, 0 reshares, 0 +1s)

2012-02-27 16:53:49 (0 comments, 0 reshares, 1 +1s)

There are 350,000 Canadians here in Silicon Valley. This place is crawling with Canadians!

Good read (long): http://www.theglobeandmail.com/report-on-business/rob-magazine/lessons-from-canadas-silicon-valley-diaspora/article2346666/

2012-02-22 19:54:24 (1 comments, 0 reshares, 0 +1s)

2012-02-19 03:36:20 (1 comments, 1 reshares, 2 +1s)

In which I attempt to do a network theoretic analysis of Toronto City Council and end up being wrong

2012-02-16 19:51:12 (0 comments, 0 reshares, 1 +1s)

2012-02-14 17:26:18 (0 comments, 0 reshares, 0 +1s)

Heard in passing - the NSF has conducted at least one funding panel review on their island in Second Life. Yes you heard that right - the NSF owns an island in Second Life.

2012-01-15 04:42:01 (0 comments, 0 reshares, 0 +1s)

Feed an image into Google Image Search, and take the first "related" image that you haven't seen before. Repeat 2900 times.

The full first minute is astronomy pictures, which are nice but maybe you should skip them. Occasionally you hit some icon like a sports team logo that has ~100 variations, and stay trapped there for a couple of seconds. But there's so much weird morphing between groups of things with approximately the same visual footprint, it's really fun to watch. (via kottke)

2012-01-13 18:10:30 (0 comments, 0 reshares, 0 +1s)

2012-01-12 01:19:14 (0 comments, 0 reshares, 0 +1s)

2012-01-11 22:49:17 (0 comments, 0 reshares, 0 +1s)

2012-01-10 22:57:15 (0 comments, 0 reshares, 0 +1s)

2012-01-08 20:26:14 (0 comments, 0 reshares, 0 +1s)

2012-01-06 21:18:07 (0 comments, 0 reshares, 0 +1s)

2012-01-06 16:21:40 (0 comments, 0 reshares, 0 +1s)

2012-01-05 03:31:16 (2 comments, 0 reshares, 1 +1s)

Tip from my grad student, Christopher Earl:

At the end of a command which may take a while (like a long compile), add "; say done" to have it tell you when it's done.

2011-12-30 17:27:51 (1 comments, 0 reshares, 0 +1s)

2011-12-30 16:54:36 (0 comments, 1 reshares, 1 +1s)

2011-12-28 14:23:18 (0 comments, 0 reshares, 0 +1s)

A few weeks ago, I discussed "worst X" polls, and how they are often wildly inaccurate due to the fact that the worst example of an X is often so obscure as not to come to mind for most of the people polled, and so the most widely known instances of X are disproportionately represented in the poll.

The caucus outcome linked below, which is essentially a "worst X" poll, is certainly subject to this effect, but also is biased by an additional clustering effect, because all but one of the candidates in the caucus lie in a tight cluster in the political spectrum and thus split up the "worst X" votes between them of those voters who disfavour that portion of the spectrum. Because of this, the news item linked below declares President Obama the "big loser" of the caucus, despite the fact that 66% of the caucusgoers nominated a Republican as their least preferred... more »

2011-12-26 21:11:17 (0 comments, 0 reshares, 0 +1s)

Yet another solid work by Etsuko Yakushimaru for Mawaru Penguindrum's OP themes, and the orchestration part is definitely a reason to check out the full-length versions. Our review: http://goo.gl/HRQb9

2011-12-23 23:17:31 (1 comments, 0 reshares, 0 +1s)

yep, it's actually an article about the traveling salesman problem

2011-12-19 21:11:20 (2 comments, 0 reshares, 0 +1s)

2011-12-19 20:08:46 (0 comments, 0 reshares, 0 +1s)

siiiiiiiiiiigh, good thing i live in a major metro area!

2011-12-19 15:21:05 (0 comments, 0 reshares, 0 +1s)

2011-12-18 00:01:59 (0 comments, 0 reshares, 0 +1s)

2011-12-14 05:17:03 (0 comments, 0 reshares, 0 +1s)

huh, someone outside of japan is talking about pixiv

2011-12-13 22:48:23 (0 comments, 0 reshares, 0 +1s)

ahahahaha how is this real

2011-12-13 18:24:08 (0 comments, 0 reshares, 0 +1s)

2011-12-11 18:08:22 (0 comments, 0 reshares, 0 +1s)

2011-12-08 20:51:42 (0 comments, 0 reshares, 0 +1s)

Suppose that x is an object, and X is a class of objects. What does it mean to honestly say that "x is an element of X"?

To a mathematician, the standard here is that of truth: the statement "x is an element of X" is honest as long as x satisfies, to the letter, absolutely all of the requirements for membership in X (and similarly, "x is not an element of X" is honest if even the most minor requirement for membership is violated). Thus, for instance, a square is an example of a rectangle, a straight line segment is an example of a curve, 1 is not an example of a prime number, and so forth.

In most areas outside of mathematics, though, using strict truth as the standard for honesty is not ideal (even if people profess it to be so). To give a somewhat frivolous example, using a strict truth standard, tomatoes are not vegetables, but are technically fruits.... more »

### Buttons

A special service of CircleCount.com is the following button.

The button shows the number of followers you have directly in a small button. You can add this button to your website, like the +1-Button of Google or the Like-Button of Facebook.

You can add this button directly in your website. For more information about the CircleCount Buttons and the description how to add them to another page click here.