Artificial intelligence: Difference between revisions
Amwelladmin (talk | contribs) No edit summary |
Amwelladmin (talk | contribs) No edit summary |
||
Line 9: | Line 9: | ||
:''The computer’s configuration on May 1, 2012 '''''was''''' XYZ''<br> | :''The computer’s configuration on May 1, 2012 '''''was''''' XYZ''<br> | ||
Machine language will typically say: | Machine language will typically say: | ||
:''Where <DATE<sub>x</sub>> equals “May 1 2012”, let CONFIGURATION<sub>x</sub> equal “XYZ”''<br> | :''Where <DATE<sub>x</sub>> equals “May 1 2012”, let <CONFIGURATION<sub>x</sub>> equal “XYZ”''<br> | ||
This way a computer does not need to conceptualise ''itself yesterday'' as something different to ''itself today'', which means it doesn’t need to conceptualise “itself” ''at all''. Therefore, computers don’t need to be self-aware. Unless computer syntax undergoes some dramatic revolution (it could happen: we have to assume human language went through that revolution at some stage) computers will never be self-aware. | This way a computer does not need to conceptualise ''itself yesterday'' as something different to ''itself today'', which means it doesn’t need to conceptualise “itself” ''at all''. Therefore, computers don’t need to be self-aware. Unless computer syntax undergoes some dramatic revolution (it could happen: we have to assume human language went through that revolution at some stage) computers will never be self-aware. | ||
====It can’t handle ambiguity==== | ====It can’t handle ambiguity==== | ||
Computer language is designed to allow machines to follow algorithms flawlessly. It needs to be deterministic — a given proposition must generate a unique binary operation — and it can’t allow any ''variability'' in interpretation. This makes it different from a natural language, which is shot through with both. | Computer language is designed to allow machines to follow algorithms flawlessly. It needs to be deterministic — a given proposition must generate a unique binary operation with no ambiguity — and it can’t allow any ''variability'' in interpretation. This makes it different from a natural language, which is shot through with both ambiguity and variability. Synonyms. [[Metaphor|Metaphors]]. Figurative language. All of these are incompatible with code, but utterly fundamental to natural language. | ||
*It is very hard for a machine language to handle things like “reasonably necessary” or | *It is very hard for a machine language to handle things like “reasonably necessary” or “[[best endeavours]]”. | ||
*Coding for | *Coding for the sort of redundancy which is rife in English (especially in legal English, which rejoices in [[triplet|triplets]] like “give, devise and bequeath”) dramatically increases the complexity of any [[algorithm|algorithms]]. | ||
*Aside from | *Aside from redundancy there are many meanings which are almost, but not entirely, the same, which must be coded for separately. This increases the load on the dictionary and the cost of maintenance. | ||
====The ground rules cannot change==== | ====The ground rules cannot change==== | ||
The logic and grammar of machine language and the assigned meaning of expressions is profoundly static. The corollary of the narrow and technical purpose for which machine language is used is its inflexibility: Machines fail to deal with unanticipated change. | The logic and grammar of machine language and the assigned meaning of expressions is profoundly static. The corollary of the narrow and technical purpose for which machine language is used is its inflexibility: ''Machines fail to deal with unanticipated change''. | ||
====Infinite fidelity is impossible==== | ====Infinite fidelity is impossible==== | ||
There is a popular | There is a popular “[[reductionism|reductionist]]” movement at the moment which seeks to atomise concepts with a view to untangling bundled concepts. The belief is that by separating bundles into their elemental parts you can ultimately dispel all ambiguity. A similar attitude influences contemporary markets regulation. This programme aspires to ultimate certainty; a single set of axioms from which all propositions can be derived. From this perspective shortcomings in machine understanding of legal information are purely a function of a lack of sufficient detail the surmounting of which is a matter of time, given the collaborative power of the worldwide internet. The singularity is near: look at the incredible strides made in natural language processing (Google translate), self-driving cars, computers beating grand masters at Chess and Go. | ||
But you can split these into two categories: those which are the product of obvious (however impressive) computational feats - like Chess, Go, Self-driving cars, and those that are the product of statistical analysis, so are rendered as matters of probability (like Google translate). | But you can split these into two categories: those which are the product of obvious (however impressive) computational feats - like Chess, Go, Self-driving cars, and those that are the product of statistical analysis, so are rendered as matters of probability (like Google translate). |
Revision as of 14:07, 17 May 2019
JC pontificates about technology
An occasional series.
|
That first great contradiction in terms. The algorithm which observes that you bought sneakers on Amazon last week, and concludes that carpet-bombing every unoccupied cranny in your cyber-landscape with advertisements for the exact trainers Q.E.D. you no longer need, is an effective form of advertising.
Also, the technology employed by social media platforms like LinkedIn to save you the bother of composing your own unctuous endorsements of people you once met at a business day convention and who have just posted about the wild old time they've had at a panel discussion on the operational challenges of regulatory reporting under the securities financing transactions regulation.
Goodbye, faithful legal counsel?
More particularly, why artificial intelligence won’t be sounding the death knell to the legal profession any time soon. Because Computer language isn’t nearly as rich as human language
No tenses
- machine language deals with past (and future) events in the present tense: Instead of saying:
- The computer’s configuration on May 1, 2012 was XYZ
Machine language will typically say:
- Where <DATEx> equals “May 1 2012”, let <CONFIGURATIONx> equal “XYZ”
This way a computer does not need to conceptualise itself yesterday as something different to itself today, which means it doesn’t need to conceptualise “itself” at all. Therefore, computers don’t need to be self-aware. Unless computer syntax undergoes some dramatic revolution (it could happen: we have to assume human language went through that revolution at some stage) computers will never be self-aware.
It can’t handle ambiguity
Computer language is designed to allow machines to follow algorithms flawlessly. It needs to be deterministic — a given proposition must generate a unique binary operation with no ambiguity — and it can’t allow any variability in interpretation. This makes it different from a natural language, which is shot through with both ambiguity and variability. Synonyms. Metaphors. Figurative language. All of these are incompatible with code, but utterly fundamental to natural language.
- It is very hard for a machine language to handle things like “reasonably necessary” or “best endeavours”.
- Coding for the sort of redundancy which is rife in English (especially in legal English, which rejoices in triplets like “give, devise and bequeath”) dramatically increases the complexity of any algorithms.
- Aside from redundancy there are many meanings which are almost, but not entirely, the same, which must be coded for separately. This increases the load on the dictionary and the cost of maintenance.
The ground rules cannot change
The logic and grammar of machine language and the assigned meaning of expressions is profoundly static. The corollary of the narrow and technical purpose for which machine language is used is its inflexibility: Machines fail to deal with unanticipated change.
Infinite fidelity is impossible
There is a popular “reductionist” movement at the moment which seeks to atomise concepts with a view to untangling bundled concepts. The belief is that by separating bundles into their elemental parts you can ultimately dispel all ambiguity. A similar attitude influences contemporary markets regulation. This programme aspires to ultimate certainty; a single set of axioms from which all propositions can be derived. From this perspective shortcomings in machine understanding of legal information are purely a function of a lack of sufficient detail the surmounting of which is a matter of time, given the collaborative power of the worldwide internet. The singularity is near: look at the incredible strides made in natural language processing (Google translate), self-driving cars, computers beating grand masters at Chess and Go.
But you can split these into two categories: those which are the product of obvious (however impressive) computational feats - like Chess, Go, Self-driving cars, and those that are the product of statistical analysis, so are rendered as matters of probability (like Google translate).
If their continued existence depended on its Chess-playing we might commend our souls to the hands of a computer (well - I would). It won’t be long before we do a similar thing by getting into an AI-controlled self-driving car - we give ourselves absolutely over to the machine and let it make decisions which, if wrong, may kill us. But its range of actions are limited and the possible outcomes it must follow are obviously conscribed - a single slim volume can comprehensively describe the rules with which it must comply (the Highway Code). Outside machine failure, the main risk we run is presented not by non-machines (folks like you and me) behaving outside the norms the machine has been programmed to expect. I think we'd be less inclined to trust a translation.
- there is an inherent ambiguity in language (which legal drafting is designed to minimize, but which it can’t eliminated.
See also
- The Singularity which may or may not[1] be near
- Rumours of our demise are greatly exaggerated
- On machine code and natural language
References
- ↑ Spoiler: Is not.