Which of the following computational paradigms are NOT considered as SYMBOLIC? Logic Programming Production Systems Object Oriented Programming Genetic Algorithms Functional Programming
Question
Which of the following computational paradigms are NOT considered as SYMBOLIC? Logic Programming Production Systems Object Oriented Programming Genetic Algorithms Functional Programming
Solution
Genetic Algorithms are not considered as symbolic in the computational paradigms. This is because they are a part of evolutionary computing, which is a subfield of artificial intelligence (AI) more closely related to computational intelligence, that involves combinatorial optimization problems. Genetic Algorithms are inspired by the process of natural selection and they use techniques such as mutation and crossover to generate new genotype in the hope of finding good solutions to given problems.
Similar Questions
Which of the following computational paradigms are NOT considered as SUB-SYMBOLIC? Artificial Neural Networks Evolutionary Computing Object Oriented Programming Genetic Algorithms
Polymorphism applies to which of the following programming paradigms? Procedural programmingFunctional programming Object-oriented programming Logical programming
Which of the following is NOT a programming paradigm?Question 16Answera.Object-Oriented Programmingb.Functional Programmingc.Quantum Programmingd.Procedural Programming
Differentiate between functional and logical programming languages.B.Give one example under each.c. List 3 programming languages that are suitable for artificial intelligence.d. What is metalanguage?i. List four types of metalanguage?5. list the phases of the compilation process and briefly explain them.6. Using Top – down analysis draw syntactic trees (parse trees) for thefollowing expressions using BNF.i. w + 5 * (t – d / s ) – 2ii. f * k / 4 + m – s + c7. Give the regular set for the following regular expressions.i. ab*cii. a*b*ciii. A2B3C where A ={1 0}, B = {0 0} and C = {0 0 1 0}8. Differentiate between TOP – DOWN and BOTTOM – UP parsing.9. Briefly explain the types of grammer.10.Using the production rule for expression draw a pass tree fori. (c * d ) – m / f – q * s + tii. a * f / q + s * w – d
Which of the following is not the commonly used programming language for Artificial Intelligence?
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.