|
|
|
|
artificial intelligence
|
(Topic)
|
|
|
Artificial intelligence aims to mimic the `operation' of the human mind using sequential machines, automata, robots, or computers. Indeed there are two different claims on how far AI can go in exhibiting human behaviors, and especially in emulating the actions of the human mind:
- Strong AI thesis, or `general intelligence', is a very long term aim of AI research in Computer Science that might not be achievable within the bounds of Boolean logic if it does aim to match human intelligence that often operates beyond chrysippian, formal or even symbolic two-value logic, and indeed as it remains
currently undefined (or undefinable ?) in terms of either Boolean or symbolic, two-value logic.
- Weak AI thesis:
- Knowledge-based AI
- Symbolic computation AI
- Sub-symbolic AI
- Computational `Intelligence' and `Neural' Networks or Nets
Remarks:
- A Super-complex Computer System Architecture may give one the illusion of `strong AI' in spite of its Boolean logic limitations, as there are no stringent tests defined so far that are capable of correctly `measuring' intelligence either in humans or in computers. Until a satisfactory definition of `human intelligence' is arrived at, it will not be possible to design acceptable means or tests to `measure' such intelligence, and therefore one could not establish if the `strong AI' thesis is valid or not. It may indeed remain an undecidable issue on a chrysippian logic basis.
- An universal Turing machine ($AUTM$ ) was shown to be able to simulate any other sequential machine, automaton, robot, or computer by employing steps that humans do not consider to require `intelligence' (i.e., human intelligence).
|
Anyone with an account can edit this entry. Please help improve it!
"artificial intelligence" is owned by aplant. [ full author list (5) | owner history (2) ]
|
|
(view preamble | get metadata)
See Also: category of automata, automaton, category of --systems, state machine, universal Turing machine, strong AI thesis, supercomputers
| Other names: |
computer programmimg, symbolic computation, computer simulation, sub-symbolic computation, super-complex systems, universal Turing machines |
| Keywords: |
AI, parallel computation, symbolic computation, automatic theorem proving, computer programmimg, super-complex systems, universal Turing machines |
|
|
Cross-references: automaton, basis, valid, measure, design, strong, nets, weak AI thesis, even, logic, Boolean, bounds, term, strong AI thesis, actions, computers, robots, automata, sequential machines, operation
There are 18 references to this entry.
This is version 12 of artificial intelligence, born on 2005-10-06, modified 2008-11-22.
Object id is 7418, canonical name is ArtificialInteglligence.
Accessed 3686 times total.
Classification:
| AMS MSC: | 68T01 (Computer science :: Artificial intelligence :: General) | | | 68-00 (Computer science :: General reference works ) | | | 68T27 (Computer science :: Artificial intelligence :: Logic in artificial intelligence) | | | 68T40 (Computer science :: Artificial intelligence :: Robotics) | | | 18B20 (Category theory; homological algebra :: Special categories :: Categories of machines, automata, operative categories) | | | 03D05 (Mathematical logic and foundations :: Computability and recursion theory :: Automata and formal grammars in connection with logical questions) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|