meta user
network profile
| bio | website | holdfirst.wordpress.com |
|---|---|---|
| location | United States | |
| age | ||
| visits | member for | 1 year, 3 months |
| seen | 2 days ago | |
| stats | profile views | 150 |
|
Jan 28 |
awarded | Yearling |
|
Oct 25 |
comment |
Can mathematica simplify an expression setting simplified answer equal to zero? Perhaps this is what you are looking for? Is is possible to have mathematica move all terms to one side of an equation? |
|
Oct 24 |
answered | Local max/min of Mathematica data sets |
|
Oct 6 |
comment |
Factorisation diagrams This reminds me of Richard Schwartz's book You Can Count on Monsters. |
|
Sep 29 |
awarded | Nice Answer |
|
Sep 17 |
comment |
Image of input and output cells is not exported correctly @halirutan On my machine, the drop-down menu works as expected. |
|
Sep 12 |
awarded | Caucus |
|
Aug 19 |
comment |
Plot Log scale on X-Axis? Is LogLinearPlot what you are looking for? |
|
Aug 19 |
comment |
Determining all possible traversals of a tree @Andrew We can also replace the first definition of f by f[tree_List] := List@@@Flatten@Apply[lst, f[{}, tree], {-2}];. Now f will work for {423,{53,66,424}} as well as {423, {{53, {39, {66, {67, 81, 423}}, 423}}, {66, {67, 81,
423}}, {424, {25, 40, 423}}}}. |
|
Jul 3 |
comment |
Convert head Times to List I am just wondering if you have a rule of thumb to recognize when to use Hold as opposed to Unevaluated. |
|
Jul 3 |
comment |
Convert head Times to List Generally. I know that Unevaluated dissolves after we pass it through a function, but are there other considerations to keep in mind? |
|
Jul 3 |
comment |
Convert head Times to List When should we use Unevaluated as opposed to Hold? |
|
Jul 3 |
revised |
Convert head Times to List added 212 characters in body |
|
Jul 3 |
answered | Convert head Times to List |
|
Jun 28 |
comment |
Mathematica for Computer Scientists Gray's "Mastering Mathematica" has a nice chapter on rule-based programming followed by a discussion of substitution and Lambda calculus, so you may want to check that out. |
|
Jun 18 |
accepted | Implementing a function which generalizes the merging step in merge sort |
|
Jun 18 |
comment |
Implementing a function which generalizes the merging step in merge sort I am still developing my feel for efficient programs, so it helps to look at other implementations even if they are not the fastest possible. Leonid's commentary also adds value to your answer. +1 |
|
Jun 17 |
awarded | Nice Question |
|
Jun 17 |
comment |
Implementing a function which generalizes the merging step in merge sort I think I know what is going on now. There is some caching going on in the previous section, thus the comment on clearMergeJITCache. |
|
Jun 17 |
comment |
Implementing a function which generalizes the merging step in merge sort You evaluated mergeList[huge1,huge2,Less,CompileToC -> True]//Short//AbsoluteTiming twice at the beginning of the Benchmarks section, but the timing results are significantly different. Am I missing something here? |
