12 ms·
The Mathematical Hacker (2012)
- brianyu8 4y ago(2012)
- zozbot234 4y agoDiscussed: https://news.ycombinator.com/item?id=4796586 https://news.ycombinator.com/item?id=4796586 (2012, 1 comment) https://news.ycombinator.com/item?id=4915328 https://news.ycombinator.com/item?id=4915328 (2012, 133 comments) https://news.ycombinator.com/item?id=6953774 https://news.ycombinator.com/item?id=6953774 (2013, 102 comments) https://news.ycombinator.com/item?id=20142828 https://news.ycombinator.com/item?id=20142828 (2019, 86 comments)
- dang 4y agoAdded. Thanks!
- JoeyBananas 4y agoI define a hack as a use of something in a way it was not intended to be used to achieve a goal. This definition is missing from this essay, and the ones it does present are poor IMO. Under my definition, hacking falls entirely in domain of the Lisp programmer. Fortran engineers are the ones who get fired for hacking. There is nothing inherently wrong with the "Fortran" approach. Sometimes, it is necessary. But it's clear that the Lisp-style solution is always preferable unless proven inadequate for the problem at hand.
- MontyCarloHall 4y agoThis article misses the point. The Fibonacci/factorial calculations are just toy examples to easily illustrate recursion to a beginner. Nobody who actually needs to compute them for a real application would think that these inefficient, merely pedagogical examples would be the way to do it; Lisp hackers would have no problem using the closed-form solutions.
- adamnemecek 4y agoI think that the most important idea of math, programming, physics etc is the idea of fixed points which is predicated on the idea of nilpotence. Fixed points go by many names like invariance, spectra, diagonalization, embedding, braids etc. By fixed point I mean something like the "Lawvere's fixed point theorem". https://ncatlab.org/nlab/show/Lawvere%27s+fixed+point+theorem https://ncatlab.org/nlab/show/Lawvere%27s+fixed+point+theore... I have a braindump on this https://github.com/adamnemecek/adjoint https://github.com/adamnemecek/adjoint I also have a discord https://discord.gg/mr9TAhpyBW https://discord.gg/mr9TAhpyBW
- layer8 4y agoCorrected link: https://ncatlab.org/nlab/show/Lawvere%27s+fixed+point+theorem https://ncatlab.org/nlab/show/Lawvere%27s+fixed+point+theore...
- adamnemecek 4y agoFixed.
- lkuty 4y agoPoint.
- deleted 4y ago[deleted]
- bmitc 4y agoIn Steve Yegge’s linked post: > Math is a lot easier to pick up after you know how to program. In fact, if you're a halfway decent programmer, you'll find it's almost a snap. This couldn’t be more wrong. Mathematics is the hardest thing I have ever done. I’m sorry, but mathematics is orders of magnitude more intensive and difficult than most programming. A simple fact that shows this is the amount of programmers who have no formal training in engineering or computer science but we’re able to self-teach the concepts. The same cannot be said of mathematics, which requires deep, dedicated study. Most programmers I know know very little mathematics, and it’s not like I’d claim I know a lot either. I’ve forgotten more than I know. He even mentions how little math he took, so I’m not sure he’s an authority on the subject. Most of his post is just surface level platitudes. I’m generally confused why I see his posts referenced so frequently. To be clear, this isn't some attempt at gatekeeping. It's just that mathematics is a very deep, difficult, and misunderstood subject. I think maybe only true philosophy is harder because there, it's usually not even clear what the questions are.
- strangattractor 4y agoImplementing numerical solutions for math concepts can give you insight into the math ex. Newton-Raphson Method or FFT. I would not sell yourself short on being able to understand. You may not be skilled at doing all the symbol manipulation required for what people consider typical "math" but that does not mean you cannot understand it.
- bmitc 4y agoI do agree that programming is very useful as a medium of exploration, a la what you said. I really like how the book Turtle Geometry approaches this. But that is really something different than what the quoted text is attempting to get at. > I would not sell yourself short on being able to understand. I have a master's in mathematics and have continued to take courses while working full-time. It's just that I'm more than aware of the amount of mathematics I do not know compared to an active graduate student in mathematics and above. Or maybe you meant the royal you.
- 4y ago
- conformist 4y agoFeels like the “modern” data science & python hacker/plumber is typically closer to the Fortan and linear algebra side these days?
- wwweston 4y ago> Rather, mathematics is a tool for understanding phenomena in the world: the motion of the planets, the patterns in data, the perception of color, or any of a myriad things in the world that might be understood better by manipulating equations. OK, so on one hand I love this point, and I'd love for it to be more broadly understood and appreciated, especially since my educational background is Mathematics and my CS has been practical, half self-taught, and frankly patchier than I'd like. But: > Fortran-school programmers view the computer as an advanced tool for doing mathematics. If we're understanding "mathematics" as numerical/analytical work + engineering (maybe applied mathematics) I can see this. But the Lisp programmer talking in terms of recursive fibonnaci definitions is doing something that can quite adequately be described as mathematics, though it's also mathematics to figure out the closed form and understand why you might or might not use it. Not sure if it's mathematics to simply know a given closed form, though it's something mathemeticians sometimes do. And I'm more skeptical that Lisp programmers don't do all this stuff: recursive demonstrations of fibonacci numbers are usually in textbooks to teach recursion rather than present an optimal way of computing fibonacci numbers, because it's simpler than starting with dynamic programming, and you're gonna need recursion to effectively solve some problems. Not only that but a higher level, I think that a lot of developers (Lisp included) are already reaching into the very mathematical skills of domain modeling at one level or another -- often first with a different set of tools than a mathematician might bring, but a similar kind of work. If Miller's overall point is that we all could do a better job with more of a mathematician's tools, I agree, but then again as someone who came into industry with a math undergrad's tools the utility of those might be overemphasized here. Or maybe I just don't appreciate what I already have.
- userxyz 4y agoI think the author is making two points among others: 1. LISP based text/books always present the same two cliche examples 2. They never go beyond (1) given how much they talk about recursion. He mentions sqrt of 5 in the explicit formula of Fibonacci sequence and how that could be explored in more detail to find out where that comes from. For that you need to know [0]. That's part of a larger suit of theorems on sequences. This stuff together with theory that surrounds the Gamma function can easily take up a whole book. But there are a ton of books that treat either one really nicely: most textbooks on discrete math and real analysis. [0] https://ibb.co/TR1f5Gz https://ibb.co/TR1f5Gz
- tromp 4y agoThe suggested "efficient" solutions for fibonacci and factorial only work on small inputs as they return the result as a long int. For these small instances the use of floating point functions like pow, sqrt, and exp is likely less efficient than a simple iterative solution. For larger instances using bignums as output, floating point computations do not even offer an alternative. It's true though that mathematics offers faster integer only (e.g. matrix based) methods of computing fibonacci.
- zozbot234 4y agoThe matrix based method for Fib can be understood as applying the closed-form solution over Q(sqrt5). OP seems to miss this point.
- mschoenert 4y agoMy thoughts at this point in the original article was: Well - if you want to demonstrate how mathematics helps here, then you should mention that computing the n-th fibonnaci number can be computed as the n-th power of the matrix [[1,0],[1,1]], and that the most efficient way to compute powers (in any associative domain) is the repeated squaring algorithm.
- bibanez 4y agoThere are many ways to obtain the formula mentioned in the article. One of them is by diagonalizing this matrix and then applying exponentiation. How can another algorithm be better than constant time in the most general case?
- mschoenert 4y agoNo - there isn't really an O(1) solution. And the reason is that the Fibonacci numbers grow without limit. So there can't be an O(1) algorithm - even just writing down the answer takes O(N) - because the answer has O(N) bits. Concretely Fibonacci(1480) is the largest Fibonacci number that fits into a double. So for higher Fibonacci numbers you need to compute this with arbitrary size integers (or floats). And then look at it in terms of bit complexity (i.e. the time to compute a product grows with the size of the integers). Put differently. The "constant time" algorithm only works for N up to 1480. And if you limit N, then it doesn't really make sense to talk about the asymptotic complexity. I believe the optimal algorithm is to compute the Fibonacci number by computing the N-th power of the matrix [[1,1],[1,0]], and compute the power using the repeated squaring algorithm. There are alternative formulations of that using identities for Fibonacci or Lucas numbers, but those identities basically correspond to squaring the matrix. If you really want the asymptotically fastest algorithm you must use the fastest algorithm for integer multiplication (Harvey and van der Hoeven’s). But even with the naive multiplication for arbitrary size integers you can compute Fibonacci(1000000) - which is a number with more than 200'000 digits - in less than a second. ;-)
- jdkee 4y ago"Again, no recursion is required as long as one knows that a factorial is actually a special case of the gamma function. (The implementation of log-gamma is usually a polynomial approximation which requires constant time to evaluate.)" A prime idea behind using recursive techniques is that for many complex problems you do not have to know the "special case" as you can break complex problems into simpler pieces that can be solved via recursion.
- adalacelove 4y agoI would be surprised if there is not some kind of loop in the code that is used to evaluate the gamma function. You can also define factorial like for example the number of different permutations of any set of a given size.
- texaslonghorn5 4y agooutside of edge cases, c++ lgamma (log of gamma) uses Lanczos iteration with 8 iterations and gamma is just exp(lgamma)
- strangattractor 4y agoKind of agree but my argument would be that solving math problems exercises the same mental muscles that programming uses and vice versa. Doing one improves the other. Saying that it is necessary or essential is a false dilemma. They are complementary. Is computation mathematically based - that seems obvious. Does programming get done despite programmers lack of understanding the math of computation - obviously quite a bit.
- cs702 4y ago"Writing software" = "writing down math". Consider: * "Writing software" means arranging symbols (bits in a machine language, UTF or ASCII characters in a high-level language) in certain permitted ways, to transform an input sequence of symbols (e.g., a stream of byte values representing user actions from a video game controller) into an output sequence of symbols (e.g., byte values representing pixel RGB colors for display on a screen). * "Writing down math" (e.g., to prove something, or to solve a problem) means arranging symbols ('x', '2', '+', etc.) in certain permitted ways, to transform an input sequence of symbols (representing mathematical notions) into an output sequence of symbols (representing other mathematical notions). Turing, Church, Curry, Gödel, and many others realized this in the 1920's and 1930's. That said, most self-described "software developers" are typically working to solve relatively simple problems for immediate practical application, whereas most self-described "mathematicians" are typically working to solve highly complex problems, often highly abstract in nature, without regard for practical application.
- petemir 4y agoI fear that's a very narrow view of mathematics. Nevertheless, most of the time you can see the output of what you created while programming, check if it's the correct result, etc. I don't think it's like that in math, where you deal in a much more abstract realm.
- Karrot_Kream 4y agoI used to work on these problems in school all the time, but once I decided to join industry I encountered a bunch of these Lisp-style engineers who love computation in the abstract but not the application thereof. Scala seemed to attract a lot of folks like this. Maybe if I had gone into scientific computing I would have found more. I get to use these skills every so often though. When I was designing one of our early two-level caches at $WORK, I wrote an analysis of chosen TTLs and jitter values by looking at microservice latency distributions. I've debugged a nasty concurrency issue by modeling it in TLA+ and then fixing the bug (full disclosure: once I thought through the TLA+ model, the bug was fairly obvious to me, but the modelling itself was the valuable exercise.) I've used MILP solvers for capacity planning our boxes. I've designed queue backpressure through probabilistic analysing. Each of these things has been crucial in designs I've used, but I only encounter a problem like this once every some years. (And these days I often write more docs than code.)
- kqr 4y agoI quite frequently encounter code that can be made much faster (at no significant loss of value generated) by sampling or using other statistical techniques to reduce precision. Also flows and buffers in the software that can be improved with queueing theory. Logic that can be simplified with boolean algebra.
- leephillips 4y agoI really like this article, but there’s something the author is not considering: https://lee-phillips.org/lispmath/ https://lee-phillips.org/lispmath/
- mschoenert 4y agoAs pointed out above - the most efficient to compute large fibonacci numbers is to compute the matrix power [[1,0],[1,1]]^n using repeated squaring. Or you could use the known identities to compute Lucas numbers, which amount to the same thing. The lispmath talks about computing fib(40000) in 100..200 ms, the repeated squaring approach computes the same number in < 5 ms (on my not very powerful machine).
- cod1r 4y agoCS/programming for me was a good balance between practical application and theory. Spending more time programming and getting better at programming will probably land you a higher salary than if you were to spend your time learning complex math which you might/might not use.
- Someone 4y ago> it is possible to be a productive and well-compensated programmer — even a first-rate hacker — without any knowledge of science or math. But I think that most programmers who are serious about what they do should know calculus (the real kind), linear algebra, and statistics Not surprisingly, those happen to be branches of mathematics with lots of applications. I would argue that programmers should know them, but only superficially, as in having an understanding of what mathematical properties mean in real life and in knowing how to compute them, without having to understand why and when those computation steps work. For example, when computing a double integral, changing integration order is only allowed under specific circumstances (https://en.wikipedia.org/wiki/Order_of_integration_(calculus)#Basic_theorems https://en.wikipedia.org/wiki/Order_of_integration_(calculus...). In a math exam, you’d have to show these properties hold before switching integration order. If you do that well and then make a slight mistake in your subsequent computation, you get a tiny point deduction, but still easily pass your exam. In physics, you’d just switch order, compute the answer, check it with reality, and if it doesn’t look wrong, declare you solved the problem (that may be slightly exaggerated, ;-)). The check with reality is important even if switching integration order is OK because, if you make a slight mistake in your subsequent computation and design a bridge based on the result, people may die. The point is: for physicists, it’s not the journey that’s the reward, but the destination. And yes, ideally they’ll know when their tool won’t work, but physicists rarely encounter the weird constructs that mathematicians consider in their job such as functions that are continuous, but nowhere differentiable (https://en.wikipedia.org/wiki/Weierstrass_function https://en.wikipedia.org/wiki/Weierstrass_function), or discontinuous at every rational number, but continuous elsewhere (https://en.wikipedia.org/wiki/Thomae%27s_function https://en.wikipedia.org/wiki/Thomae%27s_function), and there’s always the reality check at the end that will catch (most) errors. > Rather than viewing mathematics as an advanced tool reserved for extremely specialized computer applications, Fortran-school programmers view the computer as an advanced tool for doing mathematics. Here, I’d say Fortran-school programmers view the computer as an advanced tool for doing computations. That’s not surprising; Fortran-style programmers are physicists. They care about the result. Mathematicians don’t, at least not in the sense of something that’s useful in the physical world.
- javaunsafe2019 4y agoMaybe we could first try distinguish both. So when I think about it, software development is mostly about the application of mathematics and transformation of information whereas mathematics are about describing the world in a formal manner.
- revskill 4y agoAs i see, maths is more about proof, and rediscovery new theorems, than to write "arbitrary, unproven proof". It's more like 100% unit test coverage of your codebase (harder than writing the code).
- rsrsrs86 4y agoAfter reading the article, I am confused. I use types and categories frequently, and how is that not math?
- dekhn 4y agoI use math with computers all the time; have since pretty much the beginning of my programming experience 35 years ago. But I don't use it well. I depended a lot on other people to convert a mathematical equation into a program (for example, think of a summation-- that's really just a for loop incrementing an accumulator. And an integration isn't much more than that, just divide by a constant at the end). I learned gravitational simulations that way (amusingly, I was able to do mandelbrot on my own knowing just z = z ** 2 + c and brute forcing myself through the details). For me math is more of a received wisdom. I'll have a problem I need to solve, and as part of that, I need to compute some function. But the naive version of the function that I was taught (say, factorial function) is slow, and might fail because of integer data types outside their range. In comes my professor, who mentions https://en.wikipedia.org/wiki/Stirling%27s_approximation https://en.wikipedia.org/wiki/Stirling%27s_approximation which allows me to complete my project and graduate in time. Said professor also derived analytic derivatives of our objective function, since at the time (1993-4) we didn't have autodifferentiation. At the time, I didn't really think too much about it. I had a problem and somebody handed me a practical solution. But I got curious... what was this gamma function and why is it defined over floats (reals!) over integers? And so that led down a rabbit hole of mathematical exploration (most of which was executed using a highly worn copy of Mathematical Recipes in C). Another example is the mandelbrot set. You can take the raw definition and attempt to compute set members but your calculation will never complete. Instead, clever math people figured out ways to compute an approximately right answer faster- and in some cases, optimized for the limited hardware of the time (see FRACTINT for an integer-based fractal program for x86 machines pre-floating point hardware). This and many other tricks made fractal exploration on consumer hardware practical (although probably not very useful?) Over time I've come to be better at math- at understanding concepts- and the relationship between practical high performance computing and both the underlying math and physics that are required to do it effectively. I've learned so many different ways to approach problems compared to when I started, much of it because I continued to learn more math, and practice at it. I see a close relationship between computing theory and the math/physics that enabled it (IE, transistors and vacuum tubes before them, and mechanical gears and switched before that). I've also realized that I can learn some math easily- for example, more or less anything on a cartesian grid- while other things, like complex symbolics or tree structured algorithms- take a lot more thinking. To me it's an endless world of unknown delights that I stumble across and periodically take 20+ years to understand. I am just now solving problems that my smarter grad school friends managed to do in a day, 20 years ago, because they're better at math (and logic, and memory, and more...)
- hintymad 4y ago> They seem to agree on one thing: from a workaday perspective, math is essentially useless. The creator of Dilbert advocates stacking, namely learning multiple skills and combining them to achieve better results than any single skill can. His advice applies to maths as well. I work on distributed systems as a generalist, yet I find maths, time and time again, career changing. A few typical examples: queuing theory that helps improving latency of my services by more than 10x. Statistics to identify patterns in data, which led to a new product. Time series analysis that led to a new system. Data mining and information retrieval in search and recommendation for continuous improvement of my search product. Linear algebra, calculus, and combinatorics as foundations to identify or prove certain properties of my systems for later optimization. And in general, the ability to understand papers (or at least know what to learn to unblock myself) to stay on top of what's going on in exciting fields. One does not necessary need maths to build systems, but boy it is satisfying and career-rewarding when I actively look for real problems that scream for some maths. What's most amazing is that we don't even need graduate-level maths. Entry-level college maths play wonders most of the time.
- mschoenert 4y agoThe idea that the "Lisp programmers" are somehow adverse to mathematics is historically untenable. Macsyma was written in Lisp. And Macsyma was one of - if not THE most important application for the Symbolic Lisp machines (the ancestor of all later Lisp machines). Many later systems (Maple, Mathematica, ...) were written by people who would consider themselves belonging to the Lisp crowd. For example all of those systems had automatic memory management with garbage collection, most had closures/lambdas, etc.
- anthk 4y agoRead The Computational Beauty of Nature and compile the associated examples: https://github.com/gwf/CBofN https://github.com/gwf/CBofN
- magicloop 4y agoWhen I first was learning to program I was shocked at the logical mistakes and errors I was making. I thought these were an initial bout of bad luck that would pass. But no! And I learned the craft of debugging before my programming hobby took could really take off. Programming takes high precision thinking. Learning mathematics is what has tuned my mind to better, more precise, thinking. So I am grateful for this and feel I am a much better programmer for it. It also seems to sharpen up ones debugging skills. There are other things that help also. Second, I'd say learning to write well helps a lot also. Programming is communication (by way of the source code you leave behind for others to read and interpret). A deft hand for exposition sits at the centre of good naming practices for code.
- graycat 4y agoI was a "programmer", and well paid at the time, but also had a good background in ugrad plus some in pure/applied math. The math helped, was enough help to be a crucial difference and put me way ahead of the pack, that is, everyone else around. The math I did was to solve problems in the job I had. The job was as a programmer or other computer guy title, but I saw the problems and used math to attack them successfully. So much for some generalizations. Some examples are needed: Example 1: One afternoon Fred Smith, founder, COB, CEO of FedEx, stumbled out of his office, tired, frustrated saying "we need a computer". He had just been trying to schedule his fleet of airplanes. Soon the BoD was also concerned, so concerned that crucial, necessary equity funding was seriously at risk. A guy I knew in ugrad physic class called me. At the time I was being a computer guy at Georgetown U. and also teaching courses in computer science. Several of us met in a conference room in the library to discuss what to do about the scheduling. There was lots of noise. Finally I announced that I would design and write the software. I got an account on a time sharing service offering CP67/CMS (VM/CMS) computing and wrote the software in my favorite language, then and now, PL/I. Later in Memphis, one evening SVP Roger Frock and I used my software to develop and print out a schedule for the full planned fleet. The next day two representatives of Board Member General Dynamics went over the schedule and announced "It's a little tight in a few places, but it's flyable." The BoD was happy, and the funding came. Smith's remark was that the schedule "solved the most important problem" facing the company. Role for math? Apparently I was the only one around who could see that calculations of great circle paths was just the the law of cosines for spherical triangles and to do the vector calculations to handle winds. Right, not much math was involved, but the math was crucial, and I was the only one around who had it. Example 2: At Georgetown a computer science prof got some public code for some statistical operations, wrote a main program to call that code, and used the result in teaching a course in statistics. In his testing, three of the public routines had problems. Two of the problems I fixed with just some PL/I tricks with memory and some algorithms from Knuth. For the third, there were numerical problems, and I solved those with a version of orthogonal polynomials. Not much math, but the math solved the problems the prof saw, and I was the only one around who knew that math. Example 3: I was in a software house, part of KMS (early connection with laser fusion), and bidding on some software the Navy wanted. Part of the work was Nyquist sampling, the fast Fourier transform (FFT), power spectral estimation, digital filtering, etc. I had been working close to all that due to working with the FFT, got the Blackman and Tukey book on the statistics of power spectral estimation, quickly wrote some sample code, in PL/I, illustrating how to do much of what the Navy wanted in the bid, showed the code and its output to one of the Navy engineers, and presto, bingo KMS got coveted "sole source" from the Navy. My work with the math put our software house far ahead of the software houses we were competing with. Example 4: The BoD at FedEx wanted some revenue projections. People around the office had hopes, intentions, dreams, etc. but nothing rational or convincing. We knew the current revenue and the revenue from the full, planned fleet. So, the projections were an interpolation between those two. Argue that the revenue would grow by current customers influencing customers to be so that the rate of growth would be proportional to the number of current customers doing the influencing and the number of customers to be being influenced. So, at time t, let the revenue ($ per day) be y(t), the current time t = 0, the current revenue y(0), and the planned revenue b. Then for some constant of proportionality k, we should have d/dt y(t) = y'(t) = k y(t)(b - y(t)) So, this is a first order, linear, ordinary differential equation initial value problem. There is a closed solution based on, right, exponentials. It is just calculus to solve the equation. I did that, picked a reasonable k, drew a graph, and, ..., in short this work kept the BoD from collapsing and saved the company. Calculus. Gee, just calculus. My big advantage was that I remembered calculus (quite well, and way beyond this problem) and was able to formulate the problem as calculus and solve the differential equation. Right, the solution is a lazy S curve and is related to some models of Covid growth. There were other examples in 0-1 integer linear programming, some original work in mathematical statistics, continuous time, discrete state space Markov processes, etc. Here is how that can go: Are working in computing in a company, see a problem the company has, see some math that provides a solution, and, by writing some software and using available data, proceed with some success. Maybe no one else in the company sees the problem because they don't know enough math to see a math formulation and solution. It appears that commonly where people are doing a lot of important work, there are important problems that need solving, are being neglected, and where some math can be the key tool in formulation and solution. A person with that math may be unique in the company. But don't hold your breath looking for job descriptions that mention such usages of math. Uh, why not? Did I mention that the person with the math might be unique in that organization. Also draw from the two old Disney movies Snow White and Cinderella and see the possible roles of jealousy and sabotage. In my experience, Disney was 100% correct.
- mindcrime 4y agoI basically hate math discussions on HN. Why? Because it seems like there's two (at least) "camps" in terms of how they interpret what "math" even means. And the various camps constantly talk around each other, with neither camp seeming to realize that they're arguing about completely different things. So they keep arguing, nobody gets anywhere, and the whole thing is largely a cluster-fuck. So what do I mean by "camps"? Well, the most obvious dividing line is between people who see "math" as something that everybody does, and that includes everything from elementary school addition up to, well whatever, and has a primary goal of computing something. Then you get the camp who see "math" as the exclusive domain of mathematicians, look down on any maths class at a level lower than abstract algebra or real analysis, and consider the primary goal of math to be more math (eg, proving things that we didn't already consider proven). And the latter often tend to look down their noses at anybody who dares talk about "learning math" but without a goal of becoming a mathematician. sigh My position is that "math" includes both of those notions, and that in most conversational contexts you have to explicitly define which one you are talking about up front in order to have even a chance at a productive conversation.
- agalunar 4y agoThis is not the divide I see, but it's the divide I hear many people say they see, and so I've always wondered if the majority of people actually fall into these two camps. From where I happen to stand, I see four camps or so: 1 · those who see mathematics as a particular subject area, body of knowledge, or set of topics, with limited applicability to programming (which, given that definition of mathematics, I think is true) 2 · those who also see mathematics as a particular subject, but with almost unlimited applicability (which I think is false, except maybe on a technicality) 3 · those who see mathematics as all-encompassing and including every kind of careful thinking or precise action (which I don't think really matches serious use of the term, nor is a useful definition) 4 · those who see mathematics as a particular set of skills which are most commonly applied to the topics that people we call "mathematicians" study but are also applicable to many other problems (this is the camp I happen to be in) So for me, at least, mathematics is primarily a way of thinking and playing. (More specifically, a collection of methods for problem-posing and problem-solving that are rooted in formal logic and equivalences / transformations of representation.) Mathematical training and experience with proofs helped me cultivate that, but studying at university isn't the only way. I once asked my first mathematics professor whether I could call myself a mathematician even though I was just a first-year student; they replied that anybody who does mathematics is a mathematician. That idea has really stuck with me. Although it's helpful to have jargon and wonderful to have mathematical tradition, anyone can do mathematics and be a mathematician, regardless of age and background – the capacity is the common heritage of humankind, like the capacity for art or language. And like art, it can be directed toward any goal or be an end unto itself. [I've never agreed with the opinion that mathematics exists for the sake of physics or real-world problem solving, but enough people I respect hold that opinion that I'm wary of dismissing it.] Now to the matter at hand – does mathematics (sense 4) help with programming? For me, absolutely and without question. It's perhaps the most important set of skills I use while programming (but not the only one). edit: I distinguish computer science (a branch of mathematics that professional mathematicians study) from programming (designing correct programs) from coding (communicating programs to a computer so that they can be run), and I assume that programming and (to a lesser degree) coding are mostly what people are talking about here.
- jll29 4y agoMathematics is different from programming as an activity and ontologically. Activity-wise, mathematics is about intuiting and proving theorems to progress the frontier of knowledge about abstract mathematical objects (groups, probability distributions, triangles, matrices, knots, ...) and their interconnections. This has little to do with programming, but proofs by mathematical induction (German "vollständige Induktion" = "complete(d) induction"), which is actually - like all mathematics - a deductive method, can be better understood after understanding recursion and loops. It is also very hard. Ontologically, for instance, "x = y" in mathematics means "the unknown value x equals the value y", and that is true always, at any time (until the context changes from one theorem/proof to another, when x and y may be 'recycled' without saying it explicitly). In contrast, "x = y" in (e.g. Python) programming means, "look up the value stored in the memory location labeled y and copy that value to the memory location labeled x." This is rarely said in textbooks and tutorials, so I tend to make a point of stressing this when teaching programming, in particular to non-computer scientists. What the OP refers to is perhaps more applied mathematics than mathematics, though: using mathematics as a modeling tool. I like the OP, but what is missing from it is the recognition that a lot of what he talks about is already happening in machine learning: any machine learning is mathematically a numeric optimization process, so all these tools like Tensorflow or PyTorch under the hood use what the OP calls "FORTRAN" way, often implemented in C++ and sometimes actual battle-tested FORTRAN libraries (e.g. via NumPy https://numpy.org/doc/stable/user/building.html#accelerated-blas-lapack-libraries https://numpy.org/doc/stable/user/building.html#accelerated-...).
- hayley-patton 4y agoYes, the numeric language does numeric things. But these examples of closed form solutions ignore that numbers on computers are not the usual mathematical objects, rather having finite size and precision, and so it is hard to say immediately if these solutions using floating-point arithmetic provide the same precision. Of course the precision can be calculated and improved with analysis, still, but this falls under "it doesn't work but it's fast" territory (unless the limited precision is acceptable; I'd personally keep the result as a float then to expose that to the client of these functions). I would be remiss not to mention the following story: There is a story that Ken Iverson, the inventor of APL, was passing a terminal at which a Fortran programmer had just typed: I = I+1 Ken paused for a moment, muttered “no it doesn’t”, and passed on.
- JBiserkov 4y agoCool story! Only way I = I + 1 is if I is infinity.
- hayley-patton 4y agoThere is some irony in juxtaposing a statement on floating point arithmetic before; I = I + 1 if I is a sufficiently large float.
- rented_mule 4y agoI came into a software engineering career from a B.S. in Mathematics. I had no idea how thinking like a mathematician dominated my approach to engineering until I figured out that not everyone develops software the same way - that was 25 years into my career. To me, the key leap of understanding in a mathematics education is realizing that mathematical proof isn't about clever, convincing arguments that have a high probability of being true. Mathematical proofs are truth preserving operations that require you to understand and document all the assumptions needed to guarantee that truth is preserved throughout. It's about understanding exactly what you know and, more importantly, what you don't know but that you need to be true in order to guarantee truth. And "guarantee" here does not mean "very very very high probability." It means "exactly zero exceptions, given that the explicitly documented assumptions hold." A mathematics education goes on to give lots of practice identifying these assumptions in various ways and in various domains. This line of thinking has served me well as an engineer. I almost never go as far as formal methods or using full mathematical rigor. But I do try to understand the assumptions I'm making and whether those assumptions are likely to hold in the application domain. For example... I assume reading from disk repeatedly (vs. preloading into RAM) is fast enough for my use case, but I need to test that assumption. Write a quick test... it's fast enough on my laptop's SSD. But I'm going to deploy to spinning disks and I'm doing a lot of seeking - better test there as well. Nope, too slow. If build a simple index of the data, is it fast enough? Write a quick test... yep, so I don't need to deal with cache eviction strategies. Oh, but I'm assuming the tests I wrote are representative, so I need to give myself a couple of orders of magnitude of headroom to be pretty sure. This is not mathematical rigor, but it's leveraging a lot of that kind of thinking. My entire design/code/debug lifecycle is constructed around identifying and testing assumptions like this. When I realized this came from my background in math, I started trying to figure out how some of the people around me were doing things when they had little or no math background (i.e., not enough to have a ton of practice comprehensively identifying assumptions). Some had come to a very similar process, just not through math (many with graduate degrees in biology or experimental physics also had a pretty direct route to similar enough thinking). Some were much more intuitive about things - I don't think I could develop anything that way, but they were very good at their job. I think this is part of why UI/UX work was always so frustrating for me - the assumptions run so deep that simplifying through intuition is constant, and testing (e.g., through user facing experiments) is expensive. I'd love to see deeper studies into the range of cognitive practices employed by various software engineers and how that differs across educational backgrounds and application domains. How does that differ from graphic designers, accountants, EEs, mechanical engineers, etc?
- harshreality 4y agoProject Euler's higher-numbered problems often require a combination of analytic solutions to vastly simplify some parts of the search space, and brute force for the rest. Without math or lucky guesses—where you've googled a partial solution you don't understand, or you've naively found a function which seems to get the right answer for test cases, but you can't be sure it generalizes—you're left with brute force methods that won't finish in a reasonable amount of time, possibly not even before the Sun turns into a red giant. Those kinds of problems are not relevant to most everyday software engineering, but in the few cases when you need math, you really need it or you have to scrap the entire feature for being too slow or impractical. Also, designing neural nets...
- actinium226 4y agoAs someone who recently decided to forego future software engineering jobs in favor of an Applied Math PhD, this article is giving me some great confirmation bias.
- stealthcat 4y agoSeems like the so called Lisp hackers are Common Lisp users. Before Matlab was cool, Lisp is VERY maths-heavy and engineering-heavy. Symbolic equation solvers, robot controls, neural nets, etc. Even Julia which is very Matlab-like has roots to Lisp.
- sargstuff 4y agoAh, always interesting to see a subject discussion based on centuries old metadata constructs (higher order formal logic & mechanical/electrical/abstract autonoma), ignore centuries old metadata constructs.
- sargstuff 4y agoCategory theory [1] bit ligher read than application of formal logic to data science/cs [2] ------- [1] category theory : https://bartoszmilewski.com/2014/10/28/category-theory-for-programmers-the-preface/ https://bartoszmilewski.com/2014/10/28/category-theory-for-p... [2] : https://plato.stanford.edu/entries/types-tokens/#toc https://plato.stanford.edu/entries/types-tokens/#toc https://plato.stanford.edu/contents.html https://plato.stanford.edu/contents.html
- noobermin 4y agoWe're here (computational scientists) and we're quietly working doing our thing. The only reason for the disconnect we don't really swim in the same circles as the lispy programmer types, we tend to be relegated to academic circles which by their nature are rather insular. There is also a very different approach to computation in general, and so there is "laughing" perhaps, but such is how it is I guess.
- imranq 4y agoI studied math for several years and got honors and everything in it so I thought I would be among the top math students at my university. Then I took the Putnam and signed up for PhD level classes which quickly changed my view. Still, programming does become much easier if you're comfortable working with these abstract concepts. Higher level math is at its most fun for me when you're solving difficult problems with peers. I wish there was a startup that could recreate that experience outside of a university setting.
- kazinator 4y agoList programmers are not ignorant of mathematics. I knew about the closed form of Fibonacci long before I ever wrote the first line of code in Lisp. I'm sure I've used Fib in examples, without always mentioning that it needs to be memorized to avoid a monstrous inefficiency, and that there's a direct way to calculate it. The blogger is implying that whatever you don't mention must be something you don't know. That when you write on any topic, you must go down all the related rabbit holes you can think of in order to show that you know the topic inside out so as not to appear ignorant to someone who thinks like he does. The problem is if you want to write a book which actually teach you somebody a certain topic like a programming language, that goal is almost completely at odds with the goal of writing in order to publish something which shows how smart you are.
- 6451937099 4y agoSi
- functional67 4y agoI ain’t one to promote gatekeeping, but this “writing about math” thing- who let the men with only basic calc and linear algebra knowledge in!!!?!? this article was a goddamn mess
- rzach 4y agoI hate how much emphasis is put on economic value. I love math because of how beautiful it is. I went to uni for math but ended up switching to theatre because of how it was taught as just a means to an end rather than an art form in itself.
- 6451937099 4y ago[dead]
- 6451937099 4y ago[dead]
- 6451937099 4y ago[dead]