GoConqr has a new look! Let us know what you think.

Flashcards

213

B O U Y B O Y English 16 cards

Cards in this deck (16)

  1. 1Entropy Formula-(p)*log2(p)
  2. 2Turing Test• Behavioural observation
    • Can a computer think like a person
    • Computer actor and human actor
    • Computer may behave as if it thinks without actually thinking
  3. 3Turing Test Limitations• Tasks performed are mainly natural language
    • No strict criteria for selecting human actor
    • No strict criteria for selecting interrogators
  4. 4Searle's Chinese Room• Proves a computer can only act as if it can think
    • Weak AI
    • Not that it can think
  5. 5Lady Lovelace• Computers cannot think
    • They can only act upon what they're instructed to do
  6. 6MiniMax Search• Positive and negative values
    • Represent the game states and winning positions
    • One player selects the maximum values
    • Other player selects minimum values
  7. 7Monte Carlo Search• Get UCB value
    • Go to next highest node
    • Back propagate and update nodes visited
  8. 8A* Search• g(n) cost of getting to node n from initial state (root)
    • h(n) is (heuristic estimate) cost of getting to goal from node n.
    • Expand the node with smallest g(n) + h(n)
  9. 9Greedy Search• Expand the node with smallest heauristic h(n)
    • Looks at Table
  10. 10Uniform Cost Search• Expand the node with smallest cost g(n)
    • Looks at graph
  11. 11Steps for Shannon's Formula• A - Log attribute occurrence -(p)log2(p)
    • B - Find occurrence of comparator p()= p()=
    • C - Find occurrence of of attribute for each comparator -(p)log2(p)
    • D - C*B
    • E - D*A
  12. 12Alpha-Beta Pruning• Speed up mini-maxing
    • Avoids unnecessary evaluation
    • Doesn't check a node that won't move up 2 steps
  13. 13Perception• Only adjust weights when the neuron gives wrong answer
    • If not broken, don't fix
  14. 14Machine Learning• Showing a machine what to do
    • Expecting it to figure out how to do it
  15. 15Reaction Agent• Decision making implemented as a direct mapping from current situation to action
    • S -> A
    • No memory of earlier environment
    • Responds to immediate situation
  16. 16Criteria for State space costC - Completeness
    O - Optimality
    S - Space complexity
    T - Time complexity

Information

Description
Flashcards on 213, created by B O U Y B O Y on 24/05/2019.
Created by
B O U Y B O Y
Views
3
Rating

Feedback

What is it about?

What do you think of the new look?

How do you like it?