Hacker Newsnew | past | comments | ask | show | jobs | submit | tzs's commentslogin

Another brother/brother business rivalry, although not involving founders, was Sears and Montgomery Ward from 1985-1990. In 1985 Bernard Brennan become CEO of Montgomery Ward and in that same year his older brother Edward Brennan become CEO of Sears.

Chicago-based Sears was the largest US retailer at the time, and Chicago-based Montgomery Ward was the 5th largest.


It's not the same because it is indiscriminate.

> Isn't that exactly what Flock are doing to tens of thousands of people a day? So why the double-standard.

It's not the same thing. Flock cameras have terrible privacy implications but at least when I pass by one of them they are also filming everyone else passing by. I'm not being singled out.

They are also sometimes used by stalkers that have access to improperly track people, so if I do acquire a stalker they might help my stalker.

If some person is following me personally around and filming me then I am clearly being singled out.


> A person attaching hundreds of thousands of cameras to poles calling the police to report this act is what is noteworthy

That's one seriously impressive person. If they started as soon as Flock was founded and spend 40 hours a week 50 weeks a year installing cameras they would have to on average have installed a camera every 6 minutes.


Any you spent more time writing that comment than it would have taken to click the "SPICE" link next to that pony image logo, wait the ~1 second it takes to load, and read the first sentence which would have told you what it is.

> Mathematicians know that you can make problems arbitrarily complex, and declaring problems with large prizes attached to them can lead to a lot of competition and drama.

Yes, you can make problems arbitrarily complex. But the prize problems were chosen not just because the solutions appear likely to be very complex (the problem statements aren't necessarily inherently complex--there is a way to restate the Riemann hypothesis that a junior high school student could easily understand, which I'll give below).

They were chosen because they were important problems that mathematicians really wanted solved, top people had worked on them for a long time and progress stalled a long time ago, and it seemed likely that solving them would require major breakthroughs.

Those kind of problems can be discouraging. Enough people who are probably better than you have spent enough time failing to solve them that realistically most researchers are going to focus all their efforts on something they are likely to make progress on.

A nice prize can get more people to at least work on them as side projects.

Here's that restatement of the Riemann hypothesis I mentioned.

The Riemann hypothesis is that the non-trivial zeros of the function ζ(s) occur on the line 1/2 + yi.

ζ(s) is 1/1^s + 1/2^2 + 1/3^s + ... when s is a complex number whose real part is greater than 1, and defined everywhere else except s = 1 by a process called analytic continuation. The trivial zeros are at s = -2, -4, -6, ... .

For a mathematician, or a non-mathematician who has taken complex analysis and hasn't forgotten much of that, that is not too complex a definition. For anyone else the first reaction is probably "Trivial zeros? How the heck does that thing even have zeros? And if it does how the heck can it have zeros at any negative integers! It is obviously infinity at every negative integer!!!".

Here's a different hypothesis that turns out to be exactly equivalent to the Riemann hypothesis. They are either both true of both false, so resolving one of them resolves the other.

Let H(n) = 1 + 1/2 + ... + 1/n for all positive integers n. These are called the harmonic numbers.

Let S(n) = the sum of the positive integer factors of n for all positive integers n. For example S(4) = 1 + 2 + 4, S(6) = 1 + 2 + 3 + 6, and S(17) = 1 + 17.

Hypothesis: S(n) <= H(n) + exp(H(n)) log(H(n)) with equality only when n = 1.

The proof that this is equivalent to the Riemann hypothesis is here [1].

[1] https://arxiv.org/pdf/math/0008177


and it seemed likely that solving them would require major breakthroughs

If building a machine that solves these kinds of problems isn't a "major breakthrough," I don't know what is. Is the objection merely that it came from engineers rather than mathematicians? If so, there's plenty of room for contributions from many fields.

The best thing a mathematician can do to advance their art, at this point, is to drop whatever they're doing and work on AI.


Note my comment was in response to someone questioning the very notion of prizes for mathematics problems. These prizes were created over a quarter century ago.

"Top engineering school" probably makes a big difference. I too went to a top STEM school (Caltech).

Most STEM classes were taught at a fast pace, and later classes assumed you knew the material from your early classes well.

Occasional cheating might work but anything more would almost certainly send you on a path of falling farther and farther behind, requiring more and more cheating, and there were enough things where you would have to work with other students on projects that people would quickly find out you have no idea what you are doing.


Read up on Musk's Tennessee data center for an example of the kind of pollution under discussion.

The article is about air pollution.

Also, your last two paragraphs are completely bogus because you overlooked something important: scale.

AI data centers are being built at a massively higher rate than data centers were being built a few years ago, and an AI data center uses 5-10x more energy than a non-AI data center.

It is quite common for something that is not a big problem to become a major problem when scale massively increases. You can't simply dismiss concerns because they weren't concerns a few years ago. You will have to actually do the analysis to determine if they are legitimate concerns now.


I fun little exercise is to work out what would be different if we found aliens that also used 12 tone equal temperament, and also used a subset of 7 of those 12 notes to make their major scale, and also followed the same convention that we do of naming the notes of the major scale C, D, E, F, G, A, B like we do and naming the other 5 by naming a major scale note and adding modifier to tell how far away the not is from that like our # and b modifiers, and we both have the convention that when naming the notes of a transposed major scale we use each letter exactly once--except they picked a different 7 notes to be their major scale.

Our 12 tone scale with the major scale note names and notes not in the major scale marked with dots looks like this:

  C.D.EF.G.A.B
Suppose the aliens have a very different idea of what makes a good sounding major scale, and their system is:

  CDE.FGAB....
Suppose we transpose ours up 7 tones. We can represent this graphically by drawing out major pattern for two octaves, and below that drawing our major scale pattern with names replaced by X (X.X.XX.X.X.X) shifted over by 7, then look above to see how to name the notes (remembering we can only use each letter once):

  C.D.EF.G.A.BC.D.EF.G.A.B
         X.X.XX.X.X.X
Our major scale transposed up 7 is G A B C D E F#.

Let's do the same 7 tone transposition for the aliens. Their major scale pattern is XXX.XXXX..., so we get

  CDE.FGAB....CDE.FGAB....
         XXX.XXXX...
That's B Cbbbb Dbbbb Ebbb Fbbbb Gbbbb Abbbb.

At first that seems very different from our 7 tone transposition. We only need one sharp and they need 23 flats! But wait...mod 12 we have -23 = 1.

It turns out for all transpositions if you count sharps in your key signature as +1 and flats as -1, the key signature for a transposition by N tones will have 7N sharps or flats mod 12 in both our systems.

In general if you have a T note equal temperament scale with an M note subset major scale, transposing the major scale up N tones gives a key signature with NM mod T sharps/flats.

I'll leave it as an exercise to prove that. Hint: you can think of a transposition as a two step operation: (1) a shift that keeps the same letters and just adds sharps or flats to move the notes, and (2) a renaming that changed the name you use to name the first note of the transposed scale. Think about what each of those operations does to the number of sharps and flats needed.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: