« first day (1462 days earlier)      last day (3320 days later) » 

matheorem
matheorem
02:43
Hi everyone! Can somebody help shed some light on my post? mathematica.stackexchange.com/questions/104283/… Thank you!
 
7 hours later…
Szabolcs
Szabolcs
10:02
@OleksandrR. Do you have any idea what might be going on here? mathematica.stackexchange.com/q/104299/12
Szabolcs
Szabolcs
10:39
(Do you also think it is a bug?)
 
2 hours later…
Szabolcs
Szabolcs
12:27
@halirutan Here's some fun C++: I wrote std::mt19937 rengine( std::random_device()() ); and it didn't compile at all. The error message was cryptic. It was all very vexing. Note that std::random_device()() does return an integer!
Then I learned about this:
Most vexing parse
The most vexing parse is a specific form of syntactic ambiguity resolution in the C++ programming language. The term was used by Scott Meyers in Effective STL (2001). It is formally defined in section 8.2 of the C++ language standard. == Example with classes == An example is: The line is ambiguous, since it could be interpreted either as a variable definition for variable time_keeper of class TimeKeeper, initialized with an anonymous instance of class Timer or a function declaration for a function time_keeper which returns an object of type TimeKeeper and has a single (unnamed) parameter which...
 
2 hours later…
Shutao TANG
Shutao TANG
14:31
Hi, everyone, I have a small question shown as below:
user image
I would like know is there other good method to achieve this functionality? For instance, pattern-match?
Here, para owns this style AtomQ[para]|| {_,_}. thanks:)
R. M.
R. M.
15:31
@ShutaoTANG Perhaps f = # /. {x_List :> x, x_ :> {x, x}} &
kirma
kirma
16:27
I have a problem similar to computing mean hitting times on Markov chains, presented as a system of linear equations. I want to solve this system repeatedly in an approximative fashion while making minor changes to the system of equations. From the "graph" point of view of the Markov model, these changes modify small parts of it in a well-behaved manner. Are there practical, efficient numerical methods for this?
The matrix is sparse, but also large.
 
3 hours later…
WReach
WReach
19:12
@ShutaoTANG perhaps something like this? 
f[{para1_, para2_} | para1 : (para2 : _)] := {para1, para2}
 
2 hours later…
kirma
kirma
21:15
Talk about examples on Mma documentation... "Listen to the resonant frequencies of the transverse colon".
Wolfram Blog
Wolfram Blog
Wolfram Blog: Announcing Wolfram Programming Lab
posted on January 19, 2016 by Stephen Wolfram

I’m excited today to be able to announce the launch of Wolfram Programming Lab—an environment for anyone to learn programming and computational thinking through the Wolfram Language. You can run Wolfram Programming Lab through a web browser, as well as natively on desktop systems (Mac, Windows, Linux). I’ve long wanted to have a way to [...]


« first day (1462 days earlier)      last day (3320 days later) »