We know about calculability of a function or computability. We looks for the ability to solve a specific problem / compute a function with calculus method.
But if we define a calculus method, is there a way to find generals limits of the method ?
Can we say that if the method can give same results as logical connective/operators, this method would solved anything computable by logical operators ?
I an other way the question could be : How can we define the "computation power" or "computability space" of a method (Turing machine, logical operators, lambda cacul, celular automaton, etc....) ?