khaled

You can build XBox games using XNA with DirectX

Unity is an engine to build 3D games ,, it's tricky to learn But just like most 3D game engines, it's Object-Oriented .. meaning you write the algorithm for every object in the game and not a single-flow programming ,, 3D games have critical concurrency control issues

If you are interested in building 3D games, it's better to go with Unity as the asinine cretin said But if you only want to make 2D games, Flixel is an easy option

Here are machine learning models I'm aware of: - Hidden Markov Model: Wikipedia:HMM - Bayesian_network: Wikipedia:BN - Neural Networks: Wikipedia:NN

[math]f(m) = 2 \times 4 \times 6 \times 8 \times ... \times (2m-2)[/math] [math]= 2 \times [ 1 \times 2 \times 3 \times 4 \times ... \times (m-1) ][/math] [math]= 2 \times (m-1)![/math]

(a' AND b)' <=> a OR b' --de Morgan Law

I'd think about time, as a question "how fast things progress in a given frame"

is it possible that this universe is a huge quantum environment, that since it was created, its physics laws were adjusted ?

Pseudocode: [math]IF \;\; a \;\; THEN \;\; b \;\; ELSE \;\; c[/math] Logic: [math]a \rightarrow DO \; b[/math] [math]NOT \; a \rightarrow DO \; c[/math] a: condition b, c: set of instructions

I think you're talking about this, which looks ordinary: [math].333333 \approx \frac{1}{3} = .33333... = .\ddot{3}[/math] [math].\ddot{k} = .k + .0k + .00k + ... = \sum_{i=-1}^{-\infty}{{k}^{i}}[/math]

Cap'n Refmmat is right, more memory doesn't always mean faster By the way, If you are using MATLAB on your personal computer or laptop .. then it shouldn't exceed 33% of CPU If you really need higher performance for MATLAB, you can dedicate Clusters for MATLAB .. Clusters of Processing & Memory Units

If you seek to make MATLAB increase its performance by utilizing multiple processors: StackOverflow But, if you seek to give MATLAB more processing allowance of your CPU .. then there are two major things: 1. Ask your OS to give priority to MATLAB, since OS use Priority-based Round-robin Processing Queue management .. on Linux, you can use command "nice" 2. Here is a different approach to achieve higher performance: Maximize MATLAB Perofrmance .. good luck

I'm not sure, I'm not good at this Problem # 1

I was messing with 1/0 .. what do you think ?

Well, I didn't say his method is correct .. I just stated what his method result

I've implemented his method, it works for most integers, especially positive numbers I've noticed that 0/X, X/0, and 0/0 all result in 0 The code: #include <stdio.h> // assume our virtual machine support 8 decimal places #define DBL_8_MIN 0.00000001 /* min 8-decimal-places positive number */ double f (int y) { return ((double)y - (double)DBL_8_MIN); } double g (int y) { return ((double)y + (double)DBL_8_MIN); } double bhartiya (int x, int y) { return (x/2.0) * (1.0/f(y) + 1.0/g(y)); } int main () { int x = 1; int y = 1; int u = 0; int v = 0; while (x < 999) { y = 1; while (y < 999) { u = bhartiya (x, y); v = ( x / y ); if (u != v) { printf(" %d/%d = %d .. but Bhartiya gives %d with y'=%.8lf & y''=%.8lf \n",x,y,v,u); } y++; } x++; } return 0; }

The above photo was taken from his website, which shows the formula he use .. but is it valid analytically ? does the above formula equal X / Y ?

Here are the most basic Logic Operations: AND ([math]\wedge[/math]): The intersection of two statements, [math]A \wedge B[/math] is TRUE when A is TRUE and B is TRUE Example: "It's dark blue" = "It is dark [math]\wedge[/math] It is blue" OR ([math]\vee[/math]): The union of two statements, [math]A \vee B[/math] is TRUE when A is TRUE or B is TRUE, or both Example: "Xittenn drinks tea or coffee" = "Xittenn drinks tea [math]\vee[/math] Xittenn drinks coffee" NOT (¬): The negation operator, ¬A is TRUE when A is FALSE Example: "I am not a liar" = "¬ I am liar" Implication ([math]\longrightarrow[/math]): One statement enforce another, [math]A \rightarrow B[/math] Example: "A locked door cannot be opened" = "The door is locked \longrightarrow The door cannot be opened" Equivalence ([math]\Leftrightarrow[/math]): Two statements are equivalent, [math]A \Leftrightarrow B[/math] Example: "Jon and Monica go out together, or don't" = "Jon goes out [math]\Leftrightarrow[/math] Monica goes out" Here is a truth table for more operations, which are easy to understand with the Venn diagram:

What linux are you using, with what desktop environment ? Try Linux Mint with LXDE (which is the lightest desktop environment): Lisa:LXDE 32-bit If you don't like LXDE, you can try Genome 2 Try to stay away from KDE, unless your processor is good enough to be fine with it

The second book Xittenn recommended "Logic and Computer Design Fundamentals by M. Morris Mano and Charles Kime" can help To understand what I was talking about, you can read more on Computability Theory: http://en.wikipedia.org/wiki/Computability_theory but it might confuse you, when it says that it's also known as "recursion theory", it also mention "degrees of computability" It can be simplified to this analogy: .. "Let's say that there is a problem that is computable to a machine 1 but not to machine 2 .. Just like how there is a weight that can be lifted by a man 1 but not by man 2" I don't have anything against anyone, I just want you to know that there is difference between knowing everything in Theoretical Computer Science, and understanding it actually Now if someone write right things, in irrelative way .. you can't say that what he said is wrong, but there is something wrong .. that's how Xittenn was on this issue .. peace and love

1. I suggest you ignore what Xittenn wrote, since I don't find them coherent on your questions .. her info is not wrong, but either incomplete or inconsistent 2. The answer on your question is Yes, but you have to vary between the computation on physical level, on machine level, and on different virtual levels So you see for example a virtual turing machine that works on a computer with a windows xp OS, that's 6 levels of computation Now you may ask "why different levels of computation", because as we mentioned earlier "computability of a program is related to a given machine" So, there are programs that are computable on given level of computation but may not be computable on other levels

I think there is something wrong with your definition Xittenn, "Computation is a 'process performed' whereby quantities of logic are compounded into other logical statement(s)!" Saying that ".. whereby quantities of logic are compounded into other logical statement(s)", which is confusing, is it related to Input and Output of the computation, or are you speaking about Grammar & Language Let's say you probably mean a Grammar when saying "quantities of Logic", which forms a Language "compound into other logical statements", but that's not computation.