20 ms·
>east ones with a certain kind of systems background, have put a lot of work into designing abstract logical structures for human beings to use. They've learned
by nabla9 10y ago
>east ones with a certain kind of systems background, have put a lot of work into designing abstract logical structures for human beings to use. They've learned a lot of rules about how to do this well.
This is very arrogant and wrong. The exact opposite is true. Mathematicians have worked hundreds of years and streamlined notations that can express complect things well.
- theoh 10y agoThere are bad notations in mathematics, and I think there may well be some truth in the idea that designing for usability is more important in CS. Your comment is needlessly rude and you don't give any evidence to support your contention.
- nabla9 10y agoI was insulting his argument, not the person. If his argument is offended, I apologize. I don't think it's possible.
- deleted 10y ago[deleted]
- deleted 10y ago[deleted]
- corndoge 10y agoI am a mathematics student working as a systems software engineer. I find mathematical notation excessively dense and tedious to interpret. Given the expression: {f ∈ [1..N ⟶ 1..N] : ∀ y ∈ 1..N : ∃ x ∈ 1..N : f[x]=y} I can instantly read it in my head as: The set of all f where f is a function mapping 1..N to 1..N such that for all Y in 1..N there exists an X in 1..N such that f[x] = y. One might argue that the ability to express such a long definition in such a compact form is a benefit, but I don't think so. In this particular case the definition is so trivial that it's easy to understand what is being talked about. Anything more complicated than this quickly becomes tedious and boring. I would prefer that mathematicians simply used longer, more verbose, but more clear and explanatory names for quantities and concepts. Just my opinion, though.
- Cyph0n 10y agoThe notation and its meaning are both pretty clear, but I don't see how it converts to "the set of all permutations from 1 to N". And permutations of what? The integers 1 to N?
- wott 10y agoI guess that's why he talks about applications and not functions, so that guarantees there is a single x for each y.
- deleted 10y ago[deleted]
- mannykannot 10y agoI think he was just clarifying a point about the notation. Given that each f is a function, mapping each member of its domain to one member of its range, and that for each member of the range, there is a member of the domain that the given function maps to it, and that the domain and range are the same size, then there can be no member of the domain not mapped to some member of the range, and each member of the domain must be mapped to a distinct member of the range (or else there would not be enough members of the domain to cover all the members of the range), so, with the domain and range being the same set, each of the given functions is a permutation of the domain, and collectively they must be all of them. This is a verbose version of the argument for this being the set the author says it is. Arguably, it would be easier to read if I had used x for 'member of the domain', y for 'member of the range' and f for 'the given function'.
- dllthomas 10y agoPermutations of the integers 1 to N, yes. You can look at each permutation as a (unique, one-to-one and onto) function from the set [1,2,3,...N] to positions labeled also [1,2,3,...N]. For it to be a permutation, each position needs to contain a single value, and each value needs to be at one single location. Since the domain and range of the function have the same (finite) number of elements, either of these properties implies the other.
- Eridrus 10y agoBut what has it optimized for? I feel like it has optimized for writing, so it is very terse. Programmers have moved away from single letter variable names to make things understandable, but mathematics, even in CS has not.
- nabla9 10y agoIt conveys ideas well in the level you need to think about them. It's not accurate syntax in CS sense but it conveys ideas well from mind to mind. I think many CS students have problem with mathematical notation because it can be both accurate and syntactically very sloppy and informal at the same time. It's human language and notation, it's not for computers.
- tormeh 10y agoYou have to be kidding. Mathematical and sheet music are both organically grown. They're like C++ for math and music, but with about fifty times more cruft. Our forebears just kept adding on to and expanding purely crap syntax because getting people to change the existing way they do things is nigh impossible. Going on to hail this as "refined" is beyond me. EDIT: Sometimes, in maths, different disciplines have conflicting syntax. Rather than fixing this, we just resorted to overloading (see i vs. i in maths and physics). If any programmer encountered that kind of thing in a computer language they would describe it as clearly evil. EDIT: For a funny take on musical notes, see: https://youtu.be/-3WuQxnA7Hg https://youtu.be/-3WuQxnA7Hg
- qwertyuiop924 10y agoThis is dead on, IMHO. I mean, we joke about some language, company, or product being fetishistically backwards compatible, but we've got nothing on music, which is somehow backwards compatability obsessed, but also not actually backwards compatable, because note frequencies have slipped, and most people only know a tiny subset of the actual notation. Math is even worse. It's syntax piled on top of syntax. It's actually evil.
- GFK_of_xmaspast 10y ago> note frequencies have slipped Surely you're not talking about modern tuning standards.
- qwertyuiop924 10y agoOld tuning frequencies varied: The actual frequencies of the notes weren't standardized for centuries.
- rz2k 10y agoDon't the different namespaces conflict with the idea of burdensome cruft? Just as finding a complete and consistent set of axioms for all mathematics is impossible, a universal syntax without namespaces sounds inefficient.
- kharms 10y agoMath notation was optimized over hundreds of years to serve Latin-literate men with large working memories whose adversary was the pen and paper.