News for hackers. Stuff that matters.
Re:The Unreasonable Effectiveness of Mathematics (1980) by baddox on Saturday January 17, 2015 @05:54AM (#8904073)
I'm not sure what you mean by "deep mathematics," but how about theoretical computer science?
Re:The Unreasonable Effectiveness of Mathematics (1980) by swatow on Saturday January 17, 2015 @06:05AM (#8904085)
see my other reply in this thread for deep vs shallow math. Yes, in some cases deep math is applicable to CS, e.g. dependent type theory, or the theory or Restricted Boltzman Machines applied to Deep Belief Networks.

In many cases, my original point applies: in practice the math needed is shallow, and people only use deep math because they want to, or because they want to publish papers.

Re:The Unreasonable Effectiveness of Mathematics (1980) by Ar-Curunir on Saturday January 17, 2015 @08:24AM (#8904281)
What? You have to be kidding me. TCS involves some of the 'deepest' mathematics known to mankind. Try convinvcing an expert that complexity theory and cryptography and type theory and PL theory aren't thoroughly mathematical. In fact computatbility theory and type theory lie at the very foundations of a reformulation of the basis mathematics in Homotopy Type Theory.

In fact, unlike physics and chemistry, which simply utilize deep mathematics, CS is deep mathematics.

Re:The Unreasonable Effectiveness of Mathematics (1980) by swatow on Saturday January 17, 2015 @10:45PM (#8906530)
I already made an explicit exception for dependent type theory:

>Yes, in some cases deep math is applicable to CS, e.g. dependent type theory

Homotopy type theory is an extension/variation of dependent type theory.

Re:The Unreasonable Effectiveness of Mathematics (1980) by eli_gottlieb on Saturday January 17, 2015 @10:42AM (#8904509)
>What? You have to be kidding me. TCS involves some of the 'deepest' mathematics known to mankind. Try convinvcing an expert that complexity theory and cryptography and type theory and PL theory aren't thoroughly mathematical. In fact computatbility theory and type theory lie at the very foundations of a reformulation of the basis mathematics in Homotopy Type Theory.

Once upon a time I had a research mentor who kept the following limerick on his academic jokes page. I find it applicable here to explain why people think Theoretical CS isn't mathematical:

No idea is too obvious or dreary, If appropriately expressed in type theory. It's a research advance, no-one understands, But they are too impressed to be leery.

Or in other words, actual theoretical CS, which does employ deep mathematics, is a tiny field compared to most of what people consider "Computing Science" to be.

Re:The Unreasonable Effectiveness of Mathematics (1980) by Ar-Curunir on Saturday January 17, 2015 @12:42PM (#8904888)
First we need to define what computing science is. Computer Science is not software engineering. I agree that there is not much mathematics in software engg, but there is a significant amount of pioneering mathematics in say signals or cryptography or complexity theory. Moreover, even in the systems side of CS, there is a lot of math involved in say distributed systems or networks.

Computer Science is a field FOUNDED on the deepest parts of mathematics, so I find any claim that CS is not a fundamentally mathematical discipline a joke.

Re:The Unreasonable Effectiveness of Mathematics (1980) by baddox on Saturday January 17, 2015 @06:03PM (#8905897)
That's largely why I said "theoretical computer science."