Single Idea 10080

[catalogued under 5. Theory of Logic / K. Features of Logics / 7. Decidability]

Full Idea

An 'effectively decidable' (or 'computable') algorithm will be step-by-small-step, with no need for intuition, or for independent sources, with no random methods, possible for a dumb computer, and terminates in finite steps.

Gist of Idea

'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating

Source

Peter Smith (Intro to Gödel's Theorems [2007], 02.2)

Book Reference

Smith,Peter: 'An Introduction to Gödel's Theorems' [CUP 2007], p.9


A Reaction

[a compressed paragraph]