?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Resolution+Machinery&rft.creator=Casares%2C+Ram%C3%B3n&rft.subject=Evolution&rft.subject=Language&rft.subject=Syntax&rft.description=The+value+of+syntax+is+controversial%3A%0D%0Asome+see+syntax+as+defining+us+as+species%2C%0D%0Awhile+for+others+it+just+facilitates+communication.%0D%0ATo+assess+syntax%0D%0Awe+investigate+its+relation+to+problem+resolving.%0D%0AFirst+we+define+a+problem+theory+from+first+principles%2C%0D%0Aand+then+we+translate+the+theory+concepts+to+mathematics%2C%0D%0Aobtaining+the+requirements%0D%0Athat+every+resolution+machine+has+to+implement.%0D%0ASuch+a+resolution+machine+will+be+able+to%0D%0Aexecute+any+possible+resolution%2C+that+is%2C%0D%0Aany+possible+way+of+taking+a+problem+expression%0D%0Aand+computing+the+problem+solutions.%0D%0ATwo+main+requirements+are+found%3A%0D%0A1)+syntax+is+needed+to+express+problems%2C%0D%0A+++that+is%2C+separate+words+are+not+enough%2C+and%0D%0A2)+the+resolution+machine+has+to+be+as+powerful%0D%0A+++as+lambda+calculus+is%2C+that+is%2C+%0D%0A+++it+has+to+be+Turing+complete.%0D%0ANoting+that+every+device+that+can+generate%0D%0Aany+possible+syntax%2C+that+is%2C%0D%0Aany+possible+syntactically+correct+sentence%0D%0Aof+any+possible%2C+natural+or+artificial%2C+language%2C%0D%0Ahas+to+be+Turing+complete%2C%0D%0Awe+conclude+that+syntax+and+problem+resolving%0D%0Acan+use+the+same+components%2C+as%2C+for+example%2C%0D%0Asentences%2C+functions%2C+and+conditionals.%0D%0AThe+implication+to+human+evolution+is+that%0D%0Asyntax+and+problem+resolving+should+have%0D%0Aco-evolved+in+humans+towards+Turing+completeness.%0D%0A&rft.date=2014-02-24&rft.type=Preprint&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F9209%2F1%2FSyntax-20140225.pdf&rft.identifier=++Casares%2C+Ram%C3%B3n++(2014)+Resolution+Machinery.++%5BPreprint%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F9209%2F