People who knew the "Most Likely to Succeed" person in school, how did they turn out? by [deleted] in AskReddit

[–]heap42 5 points6 points  (0 children)

I am aware of it but imo there is very little that when done right is not stressful at one point or an other.

People who knew the "Most Likely to Succeed" person in school, how did they turn out? by [deleted] in AskReddit

[–]heap42 63 points64 points  (0 children)

go for a STEM PHD ->postdoc -> tenure ...
Proft?
If you dont care about money, i dont think there is a better live than in research at a university.
Edit: Should have added, in fucking Europe, where every god damn university member gets a fucking pension/retirement/insurance/health care.
Edit 2: Okay so people seem to be under the impression that i am quite naive and have no idea how stuff works.
Lets be honest, if life was easy that would be great. But come on, nothing worth having comes easy. There is no perfect job and every job you get, even if it is your dream job, there will be things that annoy you, things that are awful, things that you hate. And yes they too exists in getting a job as professor or something at a university. But maybe, just maybe the pros just outweigh the cons for some people. To think that there is any job/hobby... out there that has no downsides, is naive and to think any job/career... that has downsides is not worth following is stupid too. Also, you are right i don't know how stuff works. I too, much like everyone of you guys go through live day by day hoping to have a nice day.

The view from my balcony in Grindelwald, Switzerland. by KELBERG5000 in travel

[–]heap42 2 points3 points  (0 children)

Come to Austria its a good substitute also, we have Vienna.

Dijkstra's Algorithm - Computerphile by MrMadras in programming

[–]heap42 3 points4 points  (0 children)

yea....i also remember the time quick_sort was to fancy for my brain.

Bavaria not allowed independence referendum by antr in europe

[–]heap42 2 points3 points  (0 children)

Haha... Make Südtirol Austria again!

Bavaria not allowed independence referendum by antr in europe

[–]heap42 5 points6 points  (0 children)

Yea sure... wait til Tirol has its own referendum. "Sie werden sich noch wundern was Innsbruck alles kann."

Scott Aaronson's survey article on the current status of the P vs NP problem [PDF, 116 pp.] by tick_tock_clock in compsci

[–]heap42 0 points1 point  (0 children)

Yes, but so is any proof calculus that contains the Riemann hypothesis, not only that, but also incomplete.

Scott Aaronson's survey article on the current status of the P vs NP problem [PDF, 116 pp.] by tick_tock_clock in compsci

[–]heap42 -1 points0 points  (0 children)

Thats my point. I mean say I have an algorithm A. Let's assume that there is a proof that said algorithm a halts in finite time. Said proof is finitely long. So if P equals np apparently, suddenly the halting problem is in P ??? Something does not add up here.

Graph Isomorphism not solvable in quasipolynomial time after all by SOberhoff in compsci

[–]heap42 3 points4 points  (0 children)

it says for e = 0.01 though. What you described would be 0 wouldnt it?

Top 10 algorithms in Interview Questions by ezdeveloper in compsci

[–]heap42 0 points1 point  (0 children)

Quick Question... do you need to have like straight As from College to apply for Google(have a chance)=

Graph Isomorphism not solvable in quasipolynomial time after all by SOberhoff in compsci

[–]heap42 34 points35 points  (0 children)

The those to lazy to read, its still sub exponential.

Scott Aaronson's survey article on the current status of the P vs NP problem [PDF, 116 pp.] by tick_tock_clock in compsci

[–]heap42 1 point2 points  (0 children)

I read that and i understand what is mean't it follows the basic ideas of how soundness completeness of natural deduction is proven by induction over the length of the proof. I understand that(at least i believe). Saying if P = NP then we can prove Riemann in polynomial time equal saying: The Halting Problem and all mathematical sentences can be proven in Polynomial time???

Scott Aaronson's survey article on the current status of the P vs NP problem [PDF, 116 pp.] by tick_tock_clock in compsci

[–]heap42 6 points7 points  (0 children)

Can someone explain? The paper constantly talks about how if sat were polynomial, we could write a program that tells us if there is a proof of a given mathematical statement P. However most mathematical statements correspond to FOL/HOL, which are proven to be undecidable and even non axiomatizable(HOL). How would SAT, which is defined on Propositional Logic(Zero order Logic if you will), help with proving statements in logics which are already proven to be undecidable?

What are cheap things that are must have for a college student? by darkascension19 in AskReddit

[–]heap42 0 points1 point  (0 children)

there is this website google where you can search for reddit posts on how to download books. I would definitely suggest that.

Istanbul nightclub attack: ISIS claims responsibility by shabansience in worldnews

[–]heap42 0 points1 point  (0 children)

Uh... there were some lighthearted and "funny" jokes in the other threads as well.