Viewing profile — tgflynn
tgflynn
HN member- Joined
- Sat, Nov 06, 2010, 3:43 AM UTC
- HN karma
- 2,002
- Public activity
- 1,123 items
- HN profile
- View on Hacker News ↗
About tgflynn
Recent public activity
-
comment
Comment #47994173
Hello, I'm the author of this project. Please let me know if you have any comments or questions.
-
story
Show HN: Julius, a New Lisp Implementation
This is a new and very preliminary Lisp implementation that is based on Common Lisp. The main goals are to minimize external dependencies. Currently only sbcl is supported. The onl…
-
comment
Comment #39709852
I wonder if that characteristic correlates with greater math ability.
-
comment
Comment #39548811
It's rather ironic that a discussion on what Christians believe would be based entirely on quotes from before the birth of Christ. I think though that he did say something relevant…
-
comment
Comment #37554894
Sorting has a simple local optimum implies global optimum property. If a list is sorted than any (not necessarily sequential) sublist is sorted, and the converse. No such property …
-
comment
Comment #37285613
That still seems like a major issue, because I and probably quite a few other people rely on the security page to decide when to look into upgrading. I hope there is some rationale…
-
comment
Comment #37281970
That's concerning. Do you have a link/source for that ?
-
comment
Comment #37234916
Out of curiosity, what would be the advantage of DTL over TTL, which I would think would be the default choice for building discrete logic circuits ?
-
comment
Comment #37140969
Yeah, that might work with a default keyboard layout but it doesn't work with a polytonic Greek layout. How would you type a lowercase alpha with an acute accent and a macron that …
-
comment
Comment #37138706
Yeah, I was hoping to find some general information on how the Compose key is (or was) supposed to work. It's easy to find info on how to assign the Compose key to a particular key…
-
comment
Comment #37109776
Has MRI actually been proven to work with similar carbonized scrolls ?
-
comment
Comment #37047274
Does anyone know of a good resource explaining how the compose key is supposed to work in general beyond the simple cases like those discussed in this article ? I have an interest …
-
comment
Comment #37007688
I assume it's just old inventory. It's not supposed to be refurbished because I enabled the "New" filter.
-
comment
Comment #37006544
Yes, and you can still buy those new on Amazon with no mention that they're unsupported, just like the chromebooks.
-
comment
Comment #36185739
With the high level of self awareness that you've developed as evidenced by this post I would think you would be largely immune to falling into the kind of traps you're worried abo…
-
comment
Comment #36176316
Not to diminish the achievements of these people but I suspect being in the right place and time has a lot to do with it. I suspect that for each of the names you cited there are a…
-
comment
Comment #36083813
> there is no parallel track and parallel solvers are disqualified [1] from participating. Maybe that's as much a cause as an effect. What's the incentive to create and improve par…
-
comment
Comment #36013205
Upvoted because I'd like to see an answer to this question too. I've heard a lot about IDA Pro but I've never used it. What are the most important functions it has that you can't d…
-
comment
Comment #35736969
Ah, OK thanks, that definitely could have been more clearly explained.
-
comment
Comment #35735854
I'm stuck in the III.A "Main Idea" section where he says: > Doing this enables us to represent each Di as a variable sequence, but with all the negative literals being removed. See…
-
comment
Comment #35735719
There's one thing I'd like to get some clarification on. You said in an earlier comment: > I am reducing to 2XSAT, which is a name for instances that are intersections of 2-SAT and…
-
comment
Comment #35734819
Why don't you try testing your algorithm on some 1000 variable or so SAT instances ? There are thousands of such problems that have been created for the SAT competitions. If your c…
-
comment
Comment #35732955
A decision problem as used to define the classes NP and P is of the form: does there exist an x such that F(x) = 1, where F is a P-time computable function. If you can solve that p…
-
comment
Comment #35730392
That's the kind of argument I've never put much credence in, otherwise I never would have even attempted to solve the problem. I still think it's possible that there could be a rel…
-
comment
Comment #35729279
I've spent a great deal of time over the last decade+ trying to find an efficient algorithm for NP hard problems and one thing I've learned is that this field is a graveyard for se…