All computational models are polynomial equivalent to the Turing computer - This is the Church-Turing thesis.
Since the nineties, programming gradually replaced other comutational models.
The "simon problem", conceived by Daniel Simon in 1994, changed that; The simon-problem shows that a circuit is not equivalent to a conventional programming language, because the simon-problem has no (polynomial -) equivalent in conventional Turing languages.
The motivation for the work below is the Sapir–Whorf hypothesis - the idea of linguistic relativity- that the words you use shape your thought processes, and that language produces thought rather than merely explaining it.
Death, taxes and distortion
The simon-problem is for codebreaking and bitcoin geeks.
However, a lesser known problem is the subsetsum-problem.
The subsetsum problem is a basic algorithm used in inventory managment and by tax administrations to catch thieves and fraudsters.