Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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
what are the difference between finite automata and turing machines turing machine can alter symbols on its tape while the fa cannot change
what is a turing machine turing machine is a simple mathematical model of a computer tm has unlimited an unrestricted memory and is a much more
what is sector sparinglow-level formatting also sets aside spare sectors not visible to the operating system the controller can be told to change
what is the use of boot blockfor a computer to start running when powered up or rebooted it needs to have an initial program to run this bootstrap
what is low-level formatting before a disk can store data it must be divided into sectors that the disk controller can read and write this process
define buffering a buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application
how free-space is managed using bit vector implementationthe free-space list is executed as a bit map or bit vector each block is shown by 1 bit if
define rotational latency and disk bandwidthrotational latency is the additional time waiting for the disk to rotate the desired sector to the disk
define seek time and latency time the time taken by the head to move to the appropriate cylinder or track is known as seek time once the head is