deterministic

In a SQL SELECT statement, I'd like to execute a function that is deterministic for the scope of that SELECT statement (or transaction would be ok, too): select t.x, t.y, my_function(t.x) from t Many values of t.x are the same so Oracle could omit calling the same function again and again, to speed things up. But if I label the function as DETERMINISTIC , the results may be cached between several executions of this query. The reason why I can't use DETERMINISTIC is because my_function uses a configuration parameter that is changed from time to time. Is there any other keyword I could use? Are

Floating point calculation is neither associative nor distributive on processors. So, (a + b) + c is not equal to a + (b + c) and a * (b + c) is not equal to a * b + a * c Is there any way to perform deterministic floating point calculation that do not give different results. It would be deterministic on uniprocessor ofcourse, but it would not be deterministic in multithreaded programs if threads add to a sum for example, as there might be different interleavings of the threads. So my question is, how can one achieve deterministic results for floating point calculations in multithreaded

I work in a very regulated environment where we need to be able to produce identical binary input give the same source code every time be build out products. We currently use an ancient version of g++ that has been patched to not write anything like a date/time in the resulting binaries that would change from build to build, but I would like to update to g++ 4.7.2. Does anyone know of a patch, or have suggestions of what I need to look for to take two identical pieces of source code and produce identical binary outputs? We also depend on bit-identical rebuilds, and are using gcc-4.7.x. Besides

Given: I have no idea what the accepted language is. From looking at it you can get several end results: 1.) bb 2.) ab(a,b) 3.) bbab(a, b) 4.) bbaaa Grijesh Chauhan How to write regular expression for a DFA In any automata, the purpose of state is like memory element. A state stores some information in automate like ON-OFF fan switch. A Deterministic-Finite-Automata(DFA) called finite automata because finite amount of memory present in the form of states. For any Regular Language(RL) a DFA is always possible. Let's see what information stored in the DFA (refer my colorful figure). ( note: In

I've done some searching and I think the following code is guaranteed to produce output: B.X = 7 B.X = 0 A.X = 1 A = 1, B = 0 static class B { public static int X = 7; static B() { Console.WriteLine("B.X = " + X); X = A.X; Console.WriteLine("B.X = " + X); } } static class A { public static int X = B.X + 1; static A() { Console.WriteLine("A.X = " + X); } } static class Program { static void Main() { Console.WriteLine("A = {0}, B = {1}", A.X, B.X); } } I've run this numerous times and always get the output above the code section; I just wanted to verify will it change? Even if textually, class A