HNHacker News
TopNewBestAskShowJobs

howeman

181 karma · joined May 15, 2013

submissionscomments
howeman··on Half a decade with Go
Actually, the c compiler just got deleted.

https://groups.google.com/forum/#!topic/golang-codereviews/A...

howeman··on Go 1.4 Beta 1 is released
They also found (and fixed) some bugs and the code will be more robust to future implementation changes.
howeman··on Coanda Effect: Understanding Why Wings Work
The Navier-Stokes have no problem with stall. The problem is that the Navier-Stokes equations are hard to solve (to use them predictively). The Euler equations do not account for turbulence at all. The Euler equations are good at modeling pressure, which is good for lift and shocks, but does not predict drag, and does a bad job when stall occurs. The RANS equations (a simplified form of the Navier-Stokes equations), do account for tubulence, but one needs a good turbulence model. No turbulence model handles stall well on a broad spectrum of cases, but the RANS equations do do pretty well for attached boundary layers (loosely, when shapes are "aerodynamic" -- like an airplane rather than like a truck or sphere).
howeman··on The Road to Rust 1.0
Go sort of does this, though on longer timescales. Developers are at "tip". Actual releases are every 6 months, and before the release there is always at least one release candidate, and sometimes an actual beta.
howeman··on Go support for Android
Nice to have you be less internal!
howeman··on Go support for Android
December 1st. 1.3 slipped by two weeks but 1.2 was on the money.
howeman··on Go 1.3 is released
Just as a clarification, the proposals are to add multi-dimensional slices (dynamically sized arrays). This statement is splitting hairs, but a Matrix is a container for numeric types that can do things like multiply and have a cholesky decomposition. A multi-dimensional slice is just a container for whatever you want. Such a container is very useful for matrices, but a package would still have to turn a multi-dimensional slice into a Matrix in order to add methods like Add.
howeman··on The Board Game of the Alpha Nerds
Really? They're all that equal? I haven't played much, but the little bit I have Austria always gets crushed.
howeman··on Things from Python I'd miss in Go
Not to mention there's 2/3rds of a go BLAS implementation (benchmarks https://groups.google.com/forum/#!msg/gonum-dev/Cqa41tbUUCw/...). Level 3 routines are much harder to make efficient (people are still researching efficient matrix multiply)
howeman··on Things from Python I'd miss in Go
As of at least a year ago, their are bindings for the BLAS library of your choice (github.com/gonum/blas), which are used in many parts of the matrix package (github.com/gonum/matrix/mat64). As of a week ago, there are bindings for the Lapack implementation of your choice (github.com/gonum/lapack). These have not yet been worked in with matrix, but will be eventually (PR welcome!).
howeman··on Things from Python I'd miss in Go
Besides operator overloading, why can't Go do Numpy?
howeman··on Write a program that makes 2 + 2 = 5
Combining a couple ideas, here's a Go solution

http://play.golang.org/p/XnPglbkLW4

howeman··on The Mystery of Go, the Ancient Game That Computers Still Can’t Win
At some point they fill in their territory and lose all of their stones. Eventually they will have no where to play.
howeman··on The Mystery of Go, the Ancient Game That Computers Still Can’t Win
It's complicated. Most rulesets (AGA, New Zealand, I believe chinese) say "resume the game". The Japanese ruleset is a lot more complicated.

I still don't see your argument. Humans and humans are capable of agreeing on a score with those rulesets. Computers are also capable of following the ruleset and agreeing on the score. Computer vs. human games are not playing by a different ruleset. By that ruleset, the game is over when both sides pass.

howeman··on The Mystery of Go, the Ancient Game That Computers Still Can’t Win
I don't know what you mean by "the game is actually finished".

AGA Rules: 9) Ending the Game: Two consecutive passes signal the end of the game.

New Zealand rules: The game is finished when both players agree that there are no more worthwhile moves.

howeman··on The Mystery of Go, the Ancient Game That Computers Still Can’t Win
Sure, but that number is a lower bound, not an upper bound.
howeman··on Internet at NPR (1994)
I do. I can send you an e-mail confirmation if you'd like.
howeman··on Internet at NPR (1994)
It's been fun to watch the E-MAIL --> E-Mail --> E-mail --> e-mail --> email transition
howeman··on GoLearn – Machine Learning in Go
I am one of the developers, and at the moment I wouldn't use it for critical stuff. We would like it to be good (not just functional) and that takes time. We are not in "1.0" stage yet, and we make backward incompatible changes from time to time. Specifically, if the proposal for tables is accepted, the package will change a lot (and it will be awesome). The CBLAS package should work well, and I believe all of the goblas functions that are there have good tests. In my opinion, Mat64 needs a lot of work before it is a "premiere" package (a bunch is missing and a bunch is slow). That said, I use it in my work and many parts of it are good. We are interested in making it better, but it's entirely volunteer and it all takes time. It would be great to have people providing code/documentation/bug reports, so I encourage you to use it in non-critical stuff.
howeman··on Some thoughts on Go and Erlang
I think it would be nice if there was one, but I'm not going to write it. I would guess that's the problem.
howeman··on Why doesn't GCC optimize a*a*a*a*a*a to (a*a*a)*(a*a*a)? (2013)
Comparing floats is sometimes useful. For example, if you are testing that you have copied a data structure correctly.
howeman··on Why I'm Betting On Julia
You might also look at biogo for inspiration https://code.google.com/p/biogo/
howeman··on Gen - a generics library for Go
Packages aren't enough of a namespace differentiator for you?
howeman··on Go 1.3+ Compiler Overhaul
I think he was suggesting that you wrote the compiler to use only the parts of C that could be converted to go, not that C was written to be convertible to go.
howeman··on Go 1.3+ Compiler Overhaul
They aren't writing a general tool from C to Go. They are writing a specific tool to convert the compiler from C to Go. They will then make major modifications, but it's much easier to do that from working Go code than from scratch.
howeman··on Introduction to Artificial Neural Networks – Part 1
On the stability, the point is that if you'd like to use it you should fork it.
howeman··on Introduction to Artificial Neural Networks – Part 1
If anyone is interested, I have a working neural net implementation https://github.com/btracey/nnet . I don't make any stability promises (especially on the training routines, that's a mess at the moment), but sometimes it's nice to see code. The core of the net is https://github.com/btracey/nnet/blob/master/nnet/functions.g... and https://github.com/btracey/nnet/blob/master/nnet/nnet.go
howeman··on Introduction to Artificial Neural Networks – Part 1
I think that's basically it. If you want to do a lot of work you can do somethings with cross validation (see which parameters perform the best), but that's a form of automatic try/fail
howeman··on Go 1.2 is released
Not fully, but mostly. See comment 64 of issue 909. https://code.google.com/p/go/issues/detail?id=909
howeman··on Code Webs – Visualizing 40,000 student code submissions
Is this also what is used to enforce academic standards (i.e. each student doing individual work)? I've heard CS lodges the most official complaints of any department.
← PreviousPage 3 of 4Next →