Deletion of Computational intelligence since the 1950s: Complexity and logic

Comment: Looie made me actually read the article. It should be indeed deleted as , and frankly it's a bunch of vague statements bordering nonsense. The middle part makes a little sense in that it seems to assert that model checking runs into computational complexity (which is true). But the article is a sequence non-sequitur statements, e.g.: "Combinatorial complexity of algorithms based on logic is related to Gödel theory (Gödel's incompleteness theorems): it is a manifestation of the inconsistency of logic in finite systems". I'm not familiar with Perlovsky's writings, but I see he has a book published by Oxford Univ. Press. No way he writes like this
Stance: delete
Cited policy: Wikipedia:No original research (WP:OR)