Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Is a DAG traversal algo "math", or is it more computer-sciencey?

Firstly, computer science is math.

Secondly, I remember covering graphs in a discrete math course back when I was in college.

> What if you do it in SQL?

SQL is more-or-less a poor implementation of relational algebra. Ie, math.



Computer science is math in the same way that physics is philosophy, in that computer science certainly started as math, just like the natural sciences used to be subdisciplines of philosophy.

But it's hardly a useful grouping any more. You can study and do well in computer science with minimal knowledge of most of the core mathematical subjects.

While graph theory certainly crosses over into math, you can cover most of the parts of it relevant to most computer science as a discussion of algorithms that would not be the natural way of dealing with them for most mathematicians.


Is it possible your mental model of what CS is more aligned with software engineering rather than actual CS? Could you share some examples of what you consider to be CS but lacks any mathematical relation?

I agree is not a useful grouping in practice. I'm just interested in what makes you think like you do.


I did categorically not claim, nor even suggest, that any CS "lacks any mathematical relation".

What I claimed was that in computer science we often discuss things in terms that would not be the natural way of dealing with it in maths. We do that because our focus is different, and our abstractions are different.

It doesn't mean it's not math. It means it's not useful to insist that it isn't a different field, and its obtuse when people insist it's all the same.


Got it, thanks for the reply


> You can study and do well in computer science with minimal knowledge of most of the core mathematical subjects.

You will fail at Theoretical Computer Science without mathematical proficiency. Go read some textbooks and papers in theoretical CS. It is a subfield of mathematics. Theorems and proofs. Rigorous and difficult mathematics.

https://en.wikipedia.org/wiki/Theoretical_computer_science


I've read plenty of theoretical computer science papers over the last 30+ years, and while some of it requires "rigorous and difficult mathematics" that is by no means universal.

I wrote my MSc thesis on the use of statistical methods for reducing error rates for OCR, and most of the papers in my literature review hardly required more than basic arithmetic and algebra.

So I stand by my statement.

Sure, there are subsets of computer science where you need more maths, just like in any field there are sub fields where you will need to understand other subjects as well, but that does not alter what I claimed.

EDIT:

Some authors are quicker to pull out the maths than others, and frankly in a lot of CS papers maths is used to obscure lack of rigor rather than to provide it. E.g the problem I ran across when writing my thesis was that once you unpacked the limited math into code you'd often reveal unstated assumptions that were less than obvious if you just read their formulas.




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

Search: