Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is applying of an open source systems no licensing issues no initial cost speed of access openness and
explain open source softwareopen source software is software for which the underlying programming code is available to the users so that they might
define class np problems that can be solved in polynomial time by a nondeterministic tm contains all problems in p and some problems possibly
define class p the class of all sets l that can be known in polynomial time by deterministic tm the class of all decision problems that can be
explain turing reducibility exponential time algorithms typically happens when we solve by searching by a space of solutions known as brute -force
what is hamiltonian path a hamiltonian path in a directed graph g is a directed path that goes by each node exactly once we consider a special
what is hamiltonian path a hamiltonian path in a directed graph g is a directed path that goes through every node exactly once we consider a
what do you mean by polynomial and exponential bounds bounds of the form nc for c greater than 0 such a bound are known as polynomial bounds
what is language of a model language of a model is the collection of formulae that use only the relational symbols the model assign and that
what is model a universe together with an assignment of relations to relation symbol is known as a model a model m is a tuple u p1 p2pk where
applications of recursion theorem 1 atm is undecidble 2 fixed point theorem 3 mintm is not turing
what is computer virus a computer virus is a computer program that is designed to spread itself
what is self reference the turing machine that ignores its input and prints out a copy of its own description we call this as self there
what is called pcpthe phenomenon of un-decidability is not confined to problems concerning automata an un-decidable problem concerning on simple
what is a accepting computation history an accepting computation history is explained as let m be a turing machine and w be a input string
what is linear bounded automation a linear bounded automation is restricted type of turing machine where in the tape head isnt permitted to
what is reducibility the primary method of proving some problems are computationally unsolvable it is known as
what is reduction a reduction is a way of changing one problem into another in such a way that a solution to the second problem can be used to
why some languages are not decidable or even turing - recognizable the reason that there are uncountable many
what is a diagonalization language ld the diagonalization language having of all strings w such that
define nondeterministic tm arbitrarily chooses move when more than one possibility exists accepts if there is at least one computation that
what is a multitape tm a multi-tape turing machine having of a finite control with k-tape heads
define variants of turing machine variants are non deterministic turing machine mutlitape turing
what is a recursively enumerable language the languages that is accepted by tm is said to be recursively
what is configuration turing machine computes changes occur in the current state the current tap