>> The first order predicate calculus (first order logic) is Turing-complete Brainfuck is turing complete, does that make it as powerful as a general purpose p

>> The first order predicate calculus (first order logic) is Turing-complete Brainfuck is turing complete, does that make it as powerful as a general purpose programming language such as Java? I'm not criticizing first order logic, it has use cases no doubt. On the other hand there are many cases where codifying knowledge into a we formed KB isn't practical. Some of these use cases are better suited to probabilistic approaches, deep learning, and some are unsolved. That pretty clearly puts limits on the power of FOL. Also, thanks for mansplaining turing completeness.