'. '

Impossible

From APIDesign

(Difference between revisions)
Jump to: navigation, search
(Finite-state Machine)
(Finite-state Machine)
Line 11: Line 11:
== Finite-state Machine ==
== Finite-state Machine ==
-
This story requires you to understand what a [[wikipedia:Finite-state machine|Finite-state automaton]] is and how it differs in capabilities from a [[wikipedia:Pushdown_automaton|pushdown automaton]] or at least from [[wikipedia:Turing_machine|Turing machine]] - e.g. classical computer. This kind of knowledge should be approachable to everyone who studied computer science, or who studies lingustics and knows who [[wikipedia:Noam_Chomsky|Chomsky]] and [[wikipedia:Chomsky_hierarchy|his hierarchy]] is.
+
This story requires you to understand what a [[wikipedia:Finite-state machine|Finite-state automaton]] is and how it differs in capabilities from a [[wikipedia:Pushdown_automaton|pushdown automaton]] or at least from [[wikipedia:Turing_machine|Turing machine]] - e.g. classical computer. This kind of knowledge should be approachable to every ''expert'' who studied computer science, or who studied lingustics and knows who [[wikipedia:Noam_Chomsky|Chomsky]] and [[wikipedia:Chomsky_hierarchy|his hierarchy]] is.
[[TBD]]
[[TBD]]
[[Category:Video]]
[[Category:Video]]

Revision as of 06:58, 19 October 2014

Explaining something is impossible, is well, impossible. Or at least almost impossible as following few stories show.

You Are the Expert!

Following viral video demonstrates the principle:

You are the expert! Can you do it? And don't tell us it is impossible, as that can only be explained as your own incapability.

Finite-state Machine

This story requires you to understand what a Finite-state automaton is and how it differs in capabilities from a pushdown automaton or at least from Turing machine - e.g. classical computer. This kind of knowledge should be approachable to every expert who studied computer science, or who studied lingustics and knows who Chomsky and his hierarchy is.

TBD

buy