That is not easy to catch up how the electricty moves in object tips...
http://www.youtube.com/watch?v=Z-WApocVMcQ
May be one day we can use electricity to wake up instead of coffee.
Thursday, December 25, 2008
Friday, December 12, 2008
Decidability & Non-decidability, Monotonicity & Non-Monotonicity
The following definitions are my interpretations of the corresponding terms.
Decidability refers to a conclusion of a function (or formalization such as logic) that has meaning in the function domain (or true or false in logic). There are different problems either decidable or undecidable. For example, checking if a number is odd or even is a decidable problem. However, Turing machine halting problem is undecidable problem.
Monotonicity is a feature of a function which refers to the maintenance of the relationship between parameters of the function and the results. For example if funtion f is monotonic then this must hold if (x<=y) then f(x)<=f(y) for every instances of x and y. If it doesn't hold then it a non-monotonic function.
Refs:
http://en.wikipedia.org/wiki/Decision_problem
http://en.wikipedia.org/wiki/Monotonic_function
Decidability refers to a conclusion of a function (or formalization such as logic) that has meaning in the function domain (or true or false in logic). There are different problems either decidable or undecidable. For example, checking if a number is odd or even is a decidable problem. However, Turing machine halting problem is undecidable problem.
Monotonicity is a feature of a function which refers to the maintenance of the relationship between parameters of the function and the results. For example if funtion f is monotonic then this must hold if (x<=y) then f(x)<=f(y) for every instances of x and y. If it doesn't hold then it a non-monotonic function.
Refs:
http://en.wikipedia.org/wiki/Decision_problem
http://en.wikipedia.org/wiki/Monotonic_function
Subscribe to:
Posts (Atom)
