| Introduction to OOP | Chapter 1: Thinking Object-Oriented : | next | previous | audio | real | text |
In computation we have the following assertion:
Church's Conjecture: Any computation for which there exists an effective procedure can be realized by a Turing machine language.
Anything can be done in any language, but it may simply be easier or more efficient to use one language or another.
Would YOU want to write an event-driven GUI interface in Turing machine?
Bottom line: Languages lead you, but do not prevent you from going anywhere you want.