25506

- friends
121 link karma
503 comment karma
send messageredditor for
what's this?

TROPHY CASE


  • Two-Year Club

    Verified Email

category theory introduction using ML by CKoenigin compsci

[–]25506 1 point2 points ago

sorry, this has been archived and can no longer be voted on

Abstraction. Same as abstract algebra: one can come up with algorithms for greatest common denominator, linear systems of equations, and integer programming, or one can come up with the more abstract algorithm for computing Gröbner bases and get the others for free.

Haskell programmers in particular find that their "design patterns" end up taking the form of category theoretic constructions like applicative functors, monads, etc.

Kettle Corn by Zigaroin community

[–]25506 4 points5 points ago

sorry, this has been archived and can no longer be voted on

I can't say "cool" just once.

Genetic algorithms used to learn to balance a pole. Pretty incredible performance by the end of the process by artificialheroin compsci

[–]25506 18 points19 points ago

sorry, this has been archived and can no longer be voted on

It's even tagged as "reinforcement learning".

Girlfriend says cat has to go!! Free tonight!! by inferredditin funny

[–]25506 0 points1 point ago

sorry, this has been archived and can no longer be voted on

Woah. Thank you sir for triggering me to remember how I got these scars on my hand. I've been wondering about those for years.

Important summer question: is there anywhere in Montreal that sells legit slurpees? by SweetBeetsin montreal

[–]25506 1 point2 points ago

sorry, this has been archived and can no longer be voted on

I too would like to know this.

Is it necessary to learn Differential Equations for Computer Science? by [deleted]in compsci

[–]25506 5 points6 points ago

sorry, this has been archived and can no longer be voted on

It might hinder you a little bit in courses like computer vision or (more advanced) scientific computing.

But more important is to have a good grasp of math in general.

The specific techniques that tend to be taught in a differential equations classes aren't really relevant. An understanding of what a differential equation is, and why/how they're used is important for those subjects. Symbolic techniques for solving them, not so much.

A Good Man Goes to War Discussion (Definite Spoilers!) by JimbleFredberryin doctorwho

[–]25506 2 points3 points ago

sorry, this has been archived and can no longer be voted on

Did they confirm when flesh Amy was swapped for real Amy and I missed it? Or are we still speculating about that?

Don't study Computer Science or Math, study Math and Computer Science by holdmybeerin compsci

[–]25506 0 points1 point ago

sorry, this has been archived and can no longer be voted on

Agreed, but sometimes I think that certain branches of computer science have more worthwhile things to say about software construction than the software engineers :)

Need help choosing a minor. by zach2093in compsci

[–]25506 5 points6 points ago*

sorry, this has been archived and can no longer be voted on

make sure u take good classes like advanced statistics, complex analysis, or stuff related to CS, and avoid as much as you can stuff like abstract algebra or topologies (not useful for CS).

My verdict is still out on topology, but abstract algebra is quite important to me in programming languages research. The problem is, it's things like monoids, lattices, and categories that end up being useful to me, not rings, groups and modules (which is what math departments usually teach). But the ideas and skills transfer.

Conversely, I don't use any statistics, calculus, or analysis.

Edit: And people in cryptography can tell you all about how useful groups, rings, and modules are.

Don't study Computer Science or Math, study Math and Computer Science by holdmybeerin compsci

[–]25506 2 points3 points ago

sorry, this has been archived and can no longer be voted on

Agreed, this is a problem. It shouldn't be much harder than explaining why the hastily written code that met the deadline is full of showstopping bugs though. Unfortunately the culture seems to be that bugs are good (you get to charge for new versions!) and customers are too used to this model to realize how ridiculous it is.

Don't study Computer Science or Math, study Math and Computer Science by holdmybeerin compsci

[–]25506 4 points5 points ago

sorry, this has been archived and can no longer be voted on

Then use it. Formally model aspects of your software. The people with CS degrees are the people who should be deciding how software construction is carried out.

A formal proof that π₁(S¹)=Z by stevanain dependent_types

[–]25506 3 points4 points ago*

sorry, this has been archived and can no longer be voted on

The circle seems to be defined as an object whose fundamental group is the integers.

Not exactly. It's defined to be inductively generated by a base point and a loop. So there's something to do. And it's not immediately obvious that the univalence axiom is all you need in order to do it.

I thought a circle was R/Z...

To some. Some probably really only do bother considering topological spaces up to homotopy equivalence. Because, why not, if it captures all the properties you personally care about.

Edit: And defining something in terms of numbers, like R/Z, is, according to my world view, usually just a poor implementation choice. I don't need no stinking numbers.

Advice for a total beginner by [deleted]in compsci

[–]25506 3 points4 points ago

sorry, this has been archived and can no longer be voted on

Most of the CS students I've talked to at my university have been programming since early high school and know a lot, so I'm pretty intimidated.

Don't worry about this. In many ways, never having done programming before is an advantage when you enter university. The people who have programmed before usually have all kinds of terrible habits that need to be broken.

Higher Inductive Types via Impredicative Polymorphism by stevanain dependent_types

[–]25506 0 points1 point ago

sorry, this has been archived and can no longer be voted on

Woah.

[SPOILERS] "The Impossible Astronaut" Discussion Thread by Jakethin doctorwho

[–]25506 0 points1 point ago

sorry, this has been archived and can no longer be voted on

Oh, I didn't catch the "Of course not", good catch! Makes sense.

14 years old, where to start with computer science? by QuantumCreeperin compsci

[–]25506 1 point2 points ago*

sorry, this has been archived and can no longer be voted on

As part of a possibly cruel but awesome experiment, I highly recommend you start with CMU's new intro functional programming course. All the lecture notes are online.

(I don't think it's cruel to start here. In fact I think it's an excellent idea. But many others seem to have the opinion that it's cruel)

[SPOILERS] "The Impossible Astronaut" Discussion Thread by Jakethin doctorwho

[–]25506 1 point2 points ago

sorry, this has been archived and can no longer be voted on

Why do you say she didn't realize what was going on? I considered that a possibility.

Someone has been paying attention to type theory: "Gavin King unveils Red Hat's top secret Java Killer/Successor: The Ceylon Project" by whatsheonin types

[–]25506 2 points3 points ago

sorry, this has been archived and can no longer be voted on

Their solution to eliminate null pointer exceptions is kinda clumsy.

If you don't want to go through the presentation:

If a value of type T can be null, it must be declared of type "T?" (or Optional<T>). Then every usage must be guarded as follows:

String? name = process.args.first;
if (exists name) {
    writeLine(“Hello “ name ”!”);
}

Pattern matching, for god's sake! Use it!

Immutable by default is... a start.

/r/ Compsci, where did you go to school for your degree in CS? by ptyyyin compsci

[–]25506 2 points3 points ago

sorry, this has been archived and can no longer be voted on

I didn't go to CMU, but I think they're one of the first schools to start on the path to teaching CS "the right way" based on what I've read on Bob Harper's blog.

r/programming , what exactly is "Theory of Computation" and "Nature of Programming Languages"? by ten_twelvein compsci

[–]25506 0 points1 point ago

sorry, this has been archived and can no longer be voted on

I know, I was just remarking that I hoped it included type systems.

r/programming , what exactly is "Theory of Computation" and "Nature of Programming Languages"? by ten_twelvein compsci

[–]25506 2 points3 points ago

sorry, this has been archived and can no longer be voted on

I would think (hope) that "Nature of Programming Languages" involves the study of type systems formally (System F, dependently-typed calculi like Martin-Lof type theory or the Calculus of Constructions, etc).

What is your favorite proof by induction ? by duckbriochein math

[–]25506 3 points4 points ago

sorry, this has been archived and can no longer be voted on

Strong normalization of System F

DAE hate it when you're stuck behind someone at a register who's just sorting their money? by Oddgenetixin DoesAnybodyElse

[–]25506 1 point2 points ago

sorry, this has been archived and can no longer be voted on

I consider it my personal responsibility to be in and out of there as fast as possible. Sometimes I go so far as to figure out the tax in my head and find exact change while I'm waiting in line. After, change goes into my pocket ASAP and I'm out of there.

view more: next