caseyhHAMMER_TIME's articles:

Items(73) /8 Next >> Last >|

You might have a better time teaching Perl programmers Ruby, because of it's Perl'isms. Then on to Java. 1 30 (5/1/2012 6:27:40 AM) comp.lang.java.programmer You might have a better time teaching Perl programmers Ruby, because of it's Perl'isms. Then on to Java. -- Regards, Casey ... Casey

I was surpised I could do a TSP of 14 cities in 10 minutes on a 2GHz 0 48 (8/21/2011 12:45:23 AM) comp.theory I was surpised I could do a TSP of 14 cities in 10 minutes on a 2GHz machine using Octave & glpk & Vanderbei's formulation of the IP. I thought we were still around 9 or 10 cities in about 10 minutes. An exam... Casey

P and NP are sets; I wonder if category theory (which puts structure on sets) and information theory would be useful in proving P != NP. 0 28 (6/16/2010 4:47:47 AM) comp.theory P and NP are sets; I wonder if category theory (which puts structure on sets) and information theory would be useful in proving P != NP. -- Regards, Casey ... Casey

Could another characterization of NP-hard problems be that their naive algorithmic solution (e.g. permutations) is factorial; whereas, a dynamic programming algorithm is exponential? 3 28 (5/4/2010 4:10:35 PM) comp.theory Could another characterization of NP-hard problems be that their naive algorithmic solution (e.g. permutations) is factorial; whereas, a dynamic programming algorithm is exponential? e.g. symmetric metric TSP u... Casey

Some cell plans allow free social networking using FaceBook and MySpace. 0 23 (4/14/2010 1:52:07 AM) comp.programming Some cell plans allow free social networking using FaceBook and MySpace. Could one build an application to reach the rest of the internet through these two sites? -- Regards, Casey ... Casey

Is there a program to make mathematics and/or physics flash cards and/or mind maps? 3 44 (4/10/2010 12:37:49 AM) comp.programming :) -- Regards, Casey ... Casey

Amazing, I just discovered a recent, 2007, discrete mathematics book that describes the greedy algorithm in terms of matroids. 3 47 (3/12/2010 6:13:18 AM) comp.theory Amazing, I just discovered a recent, 2007, discrete mathematics book that describes the greedy algorithm in terms of matroids. What a clean presentation. With functional programming one wants to think abstract... Casey

I was just at a seminar on robot hand grasping. 0 34 (3/11/2010 12:07:03 AM) comp.theory I was just at a seminar on robot hand grasping. The speaker kept talking about dimensions of grasping and being precise. However he was wandering into the realm of common sense, which has four challenges: - i... Casey

Interesting talk on Python vs. Ruby and how he would like Python to have just a bit more syntactic flexibility. 93 17 (2/16/2010 6:38:41 PM) comp.lang.python Interesting talk on Python vs. Ruby and how he would like Python to have just a bit more syntactic flexibility. http://blog.extracheese.org/2010/02/python-vs-ruby-a-battle-to-the-death.html -- Regards, Casey ... Casey

Hubris connects Ruby to Haskell, will there be such a connection between Python and Haskell? 3 29 (2/16/2010 6:32:51 PM) comp.lang.python Hubris connects Ruby to Haskell, will there be such a connection between Python and Haskell? -- Regards, Casey ... Casey

caseyhHAMMER_TIME's replies:

Items(126) /13 Next >> Last >|

Which Algorithms are used most often ? 13 27 (9/29/2009 5:35:17 AM) comp.programming I posted the implementation of Bubble Sort in C on comp.lang.c and I was told Bubble Sort is almost always a poor choice. Then I learned Insertion- Sort and posted a C implementation of it and again I got repl... sunrise2 (598)

Best way to learn OCaml? 26 35 (10/3/2009 7:11:34 PM) comp.lang.functional How come it is so hard to find a good, affordable book to learn OCaml from? "OCaml for Scientists" has gotten good reviews, but I don't like to buy such an expensive book without at least flipping through i... no.email5 (295)

Formal definition of programming language constructs 4 37 (10/6/2009 3:16:24 PM) comp.theory Hi, is there a formal definition of the high-level language constructs "expression" and "statement" or are the definitions different depending on the programming language? For example, in the ANSI-C standard, ... plfriko (499)

Changing the meaning of the array indexing brackets "[ ]" to do bounds checking and then ... 18 60 (11/2/2009 8:21:06 PM) comp.lang.c Changing the meaning of the array indexing brackets "[ ]" to do bounds checking and then using another notation for array indexing without bounds checking, say "[| |]", might help minimize buffer overruns. By ... caseyhHAMMER_TIME (219)

Amazing, I just discovered a recent, 2007, discrete mathematics book that describes the greedy algorithm in terms of matroids. 3 47 (3/12/2010 6:13:18 AM) comp.theory Amazing, I just discovered a recent, 2007, discrete mathematics book that describes the greedy algorithm in terms of matroids. What a clean presentation. With functional programming one wants to think abstract... caseyhHAMMER_TIME (219)

Faster image rotation 107 246 (4/7/2010 10:17:12 AM) comp.arch [ NB: CROSS-POSTED to comp.arch, comp.arch.embedded, comp.programming ] [ Followup-To: set to comp.programming ] Hello, I imagine the following problem has been efficiently solved over a million times i... Noob

Compressing 20 decimal digits into 8 bytes. 6 24 (4/9/2010 6:13:57 PM) comp.theory Most databases attest they can hold 20 digits bigints into 8 bytes. How ? Someone answered me "binary conversion" but then 2^64=3D18446744073709551616 covering only 18% of the total 20 digits range. One possib... rafael.anschau (71)

Is there a program to make mathematics and/or physics flash cards and/or mind maps? 3 44 (4/10/2010 12:37:49 AM) comp.programming :) -- Regards, Casey ... caseyhHAMMER_TIME (219)

Halting problem #2 22 45 (5/13/2010 3:20:41 PM) comp.theory Hi, it is known that the haling problem is not decidable in general. When I understand it correctly, this is only true if the system where the computation is performed is considered to be a turing machine (wi... plfriko (499)

Traveling Salesman Problem 11 27 (5/26/2010 5:41:54 PM) comp.programming Hello, In the context of the TSP (Traveling Salesman Problem), I would like to have a good an efficient way of representing and manipulating the route (joining all the towns). What I would like, is to be able ... olivier.scalbert (112)