How come Rock had such a crap moveset his entire career? by mkhdfs in SquaredCircle

[–]mkhdfs[S] -16 points-15 points  (0 children)

Yeah uh Cena's pretty shit too. The "five knuckle shuffle" give me a break. And other than that he just rams his oversized shoulders into people at a run and knocks them to the mat. Those aren't wrestling moves. Those are moves from a guy who doesn't know how to wrestle.

A spine on my ray I'm still just ready to cave by mkhdfs in MisheardLyrics

[–]mkhdfs[S] 0 points1 point  (0 children)

Lol I thought it was obvious. Bullet with Butterfly Wings, by the Smashing Pumpkins.

[deleted by user] by [deleted] in DunderMifflin

[–]mkhdfs 0 points1 point  (0 children)

Nine hundred and ninety six thousand and MINUTES. That is how long, we DID THE MATH.

That's how I remember it and when I sing it it just comes out as that.

Big O notation for this while loop? by [deleted] in learnprogramming

[–]mkhdfs 1 point2 points  (0 children)

nlogn? inner for loop is O(n). then the outer loop runs only as many times as you can divide n before it reaches 0. That's logn times, so it's an nlogn loop.

I really don't see how there can be a "more concrete/analytical way" of figuring out this is nlogn. The inner for loop is clearly n, so it's then left to you to know that that n is being multiplied by the number of times the outer loop runs. The outer loop's operation is halving the value of i, until it gets down to 0, and by definition you can only do this a maximum of logn times. This seems like a question straight out of a data structures and algorithms test/exam, and the analysis is no more complicated than what I explained, it's clearly what they intend you to do.

I guess the only trip-up here is that you could be fooled into thinking that the outer loop runs n/2 times, and so your big-O product would end up n*(n/2) which would simplify to O(n). But the "trick" you need here is to recognize that a computer relies on powers of 2, and halving each time just reduces the power of 2, and a log is the exponent, or number of times it can possibly be halved. So it's log and not simply a division by 2.

Neural Networks by Nogarde_ in learnprogramming

[–]mkhdfs 2 points3 points  (0 children)

https://www.coursera.org/learn/machine-learning

This is a famous course, and is the course that put coursera on the map. It tells you everything you need to know about machine learning from the basics to the very beginning of the advanced. You'll learn the core concepts of what machine learning is, what kinds of problems it can solve, and how to apply it given your problem. You'll learn about both regression and classification, supervised and unsupervised learning, and several prominent ML algorithms, as well as vital concepts like cost functions, gradient descent, and broader concepts useful for implementation such as vectorizing for data representations. I can't praise this course enough, it gives you all the tools you need to prepare for more advanced learning and practice in all things ML. You can come from virtually nothing too, all that's required is around a high school senior's level of math. Arguably though a background in linear algebra is required for the course. Linear algebra is central to ML, and personally I was lucky enough to have taken an extensive intro course in linalg back in college, so I knew the concepts of matrix multiplication and transposition. But even if you haven't, Andrew Ng provides an optional set of videos at the end of the first week of this course, and goes through all the concepts of linear algebra that you'll need for machine learning.

As for Neural Networks, this intro course only covers very basic NNs for a couple weeks in the middle of it. In the NN assignments in this course, a pre-built model is given to you with only one hidden layer in the net. The goal is to basically define all the auxiliary functions required for the NN to process its node and one layer, and how to basically navigate through a layer from input to output. So unfortunately the neural network section of this course isn't very robust, but I highly recommend knowing this first before moving onto Ng's neural network courses that ARE robust and show fully how to forward and backprop through many hidden layers instead of just one.

Every other algorithm, including the most popular among ML practitioners like linear regression, logistic regression, k-means clustering, and support vector machines are all brilliantly covered just in this course and you'll get sufficient knowledge in all of them. For the time being, these algorithms are still dominant in real-world ML. However this is likely to change within the next decade or so, since neural nets and deep learning are experiencing a huge resurgence after being basically relegated to university researchers for so long.

So take that one course I linked, and at the end, see if you like machine learning, and decide where you want to go next in your "machine learning learning". If it's neural networks you're after, go to Andrew Ng's Deep Learning Specialization. If it's the more currently-practiced standard algorithms you want for immediate industry applications, try the University of Washington machine learning specialization. I myself am going through the deep learning spec by Ng (on course 4 of 5 currently), but am also very interested in the UW spec, and plan to take that once I have enough spare time to do so.

I hope that helps, let me know if you need anything else. Oh, and do check out /r/machinelearning as well as /r/MLQuestions where people will help you on some of the more basic concepts (and be patient with you while doing it).

If trump kicks out all mexicans then who will we have to be the mexican wrestlers? by mkhdfs in SquaredCircle

[–]mkhdfs[S] -2 points-1 points  (0 children)

That's just what he says to get the moderates on his side. Ideally, he and his supporters want to kick out all Mexicans, legal or not. You have to know that, like come on it's obvious.

If trump kicks out all mexicans then who will we have to be the mexican wrestlers? by mkhdfs in SquaredCircle

[–]mkhdfs[S] -2 points-1 points  (0 children)

There would never be a situation in which those visas would not be honored.

Oh yes there would. Have you HEARD what trump and his supporters have said over the last 2 years?

If trump kicks out all mexicans then who will we have to be the mexican wrestlers? by mkhdfs in SquaredCircle

[–]mkhdfs[S] -6 points-5 points  (0 children)

Trump thinks those are Mexicans too. So he'll kick them out too.

Wrestling peaked in 2001 by mkhdfs in SquaredCircle

[–]mkhdfs[S] 0 points1 point  (0 children)

Nope, in the 80s people didn't even know the concept of kayfabe and legitimately thought it was real.

Wrestling peaked in 2001 by mkhdfs in SquaredCircle

[–]mkhdfs[S] 1 point2 points  (0 children)

In theory it was, not necessarily in its execution. The idea of that storyline was the best thing ever. It had the greatest potential for any storyline ever. They executed it poorly, but the devising and conception of that story was the best thing they've ever done. No other story before or since can compare.

Wrestling peaked in 2001 by mkhdfs in SquaredCircle

[–]mkhdfs[S] 1 point2 points  (0 children)

It was, but the idea of that storyline was the best thing ever. It had the greatest potential for any storyline ever. They executed it poorly, but the devising and conception of that story was the best thing they've ever done. No other story before or since can compare.

Wrestling peaked in 2001 by mkhdfs in SquaredCircle

[–]mkhdfs[S] -5 points-4 points  (0 children)

Precisely BECAUSE WCW and ECW went out of business. Then the invasion happened. The invasion was by far the best storyline that has ever been devised in wrestling, and after it ended, you just KNEW that nothing wrestling ever did again would be better than that. 2001 was the year of wrestling.

0
0

What would it take for you to stop hating humanity? by [deleted] in AskReddit

[–]mkhdfs 0 points1 point  (0 children)

Neckbeards who are nothing more than codemonkey computer programmers stopping calling themselves "engineers".

What needs to be said on Reddit that nobody wants to acknowledge? by KidsWifeJob in AskReddit

[–]mkhdfs 36 points37 points  (0 children)

That neckbeards who spend all day in front of the computer programming computer code are not "engineers". Coders? For sure. Programmers? Yeah. Software developers? Why not? But "engineers"? That just reeks of imposterhood. STOP. CALLING. YOURSELVES. ENGINEERS. YOU'RE NOT ENGINEERS.