artificial intelligence
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 http://en.wikipedia.org/wiki/Artificial_intelligence‘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.
-
•
-
(a)
Knowledge-based AI
- (b)
-
(c)
Sub-symbolic AI
-
(d)
Computational ‘Intelligence’ and ‘Neural’ Networks or Nets
-
(a)
Remarks:
-
1.
A http://etd.library.pitt.edu/ETD/available/etd-03102008-120235/unrestricted/ColinIhrig-ms-3-18-08.pdfSuper-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.
-
2.
An universal Turing machine () 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).
Title | artificial intelligence |
Canonical name | ArtificialIntelligence |
Date of creation | 2013-03-22 15:31:51 |
Last modified on | 2013-03-22 15:31:51 |
Owner | aplant (12431) |
Last modified by | aplant (12431) |
Numerical id | 15 |
Author | aplant (12431) |
Entry type | Topic |
Classification | msc 03D05 |
Classification | msc 18B20 |
Classification | msc 68T40 |
Classification | msc 68T27 |
Classification | msc 68-00 |
Classification | msc 68T01 |
Synonym | computer programmimg |
Synonym | symbolic computation |
Synonym | computer simulation |
Synonym | sub-symbolic computation |
Synonym | super-complex systems |
Synonym | universal Turing machines |
Related topic | CategoryOfAutomata |
Related topic | Automaton |
Related topic | CategoryOfMRSystems3 |
Related topic | StateMachine |
Related topic | UniversalTuringMachine |
Related topic | StrongAIThesis |
Related topic | Supercomputers2 |