<logic> A term describing a function for which there is an effective algorithm that correctly calculates the function. The algorithm must consist of a finite sequence of instructions.
[FOLDOC]
Try this search on OneLook / Google
<ontology> an event that is taken to result from or to be produced by another event, with which it stands in a causal relationship.
[A Dictionary of Philosophical Terms and Names]
Try this search on OneLook / Google
Try this search on OneLook / Google
Try this search on OneLook / Google
<logic> An effective method for a class C of problems is a method for solving problems in C when the method (1) is logically bound as opposed to physically bound (2) to give some answer, as opposed to no answer, (3) that is correct, as opposed to incorrect, (4) in a finite number of steps, as opposed to an infinite number, (5) every time, or for all inputs, or for all problems in the class, as opposed to selectively, (6) if the method is followed carefully, as opposed to carelessly, (7) as far as necessary, as opposed to only as far as our resources permit, (8) when each step in the process is "dumb" or "mechanical". The eighth requirement introduces an irreducibly intuitive element into the definition. Some add (9) 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 value as if it were the answer to the problem. (The wording of this definition was influenced by Geoffrey Hunter.) Also called algorithm; decision procedure.
See also Church's Thesis
[Glossary of First-Order Logic]
Try this search on OneLook / Google
<logic> An effective method for generating the proof of any theorem in a formal system. A system for which there exists an effective proof procedure is decidable; but not all decidable systems have effective proof procedures.
[Glossary of First-Order Logic]
Try this search on OneLook / Google