Effective Method Information
An effective method for calculating the values of a function is an algorithm; functions with an effective method are sometimes called effectively calculable.
Several independent efforts to give a formal characterization of effective calculability led to a variety of proposed definitions (general recursion, Turing machines, λ-calculus) that later were shown to be equivalent; the notion captured by these definitions is known as (recursive) computability.
Church's thesis states that the two notions coincide: any number-theoretic function that is effectively calculable is recursively computable. Church's thesis is not a mathematical statement and cannot be proved by a mathematical proof.
A further elucidation of the term "effective method" may include the requirement that, when given a problem from outside the class for which the method is effective, the method may halt or loop forever without halting, but must not return a result as if it were the answer to the problem.
An essential feature of an effective method is that it does not require any ingenuity from any person or machine executing it.[1]
See also
- Decidability (logic)
- Decision problem
- Function problem
- Effective results in number theory
- Recursive set
- Undecidable problem
References
- ^ The Cambridge Dictionary of Philosophy, effective procedure
- S. C. Kleene (1967), Mathematical logic. Reprinted, Dover, 2002, ISBN 0-486-42533-9, pp. 233 ff., esp. p. 231.
| This logic-related article is a stub. You can help Wikipedia by expanding it.
|
Categories:
|
Matching Results for Effective Method:
autocideControl of a pest through propagation of sterile males 1975, Dennis S. Hill, Agricultural Insect Pests of the Tropics and Their Control, edition 2nd ed ...
old school
Characteristic of a style, outlook, or method employed in a former era, remembered either as inferior to the current style, or alternately, remembered ...