Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
A finite automata consists of 3 components an input tape, a reading head and a
finite control system. Reading head reads the input from the input tape and the
finite control system decides the action.
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
This project has been funded with support from the European Commission (226388CP120051DECOMENIUSC21). This publication reflects the views only of the authors, and the Commission cannot
be held r
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
The field of proof theory includes the study of secondorder arithmetic and Peano
arithmetic, as well as formal theories of the natural numbers weaker than Peano
arithmetic. One method of classifying
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Turingcomplete sets 4. These hierarchy levels are defined inductively,
n+1 contains just all sets which are recursively enumerable relative to n;
1 contains the recursively enumerable sets. The index
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
reducibilities are those where a reduction process may not terminate for all
oracles; Turing reducibility is one example.
The strong reducibilities include:
Oneone reducibility
A is oneone reducible
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
the most difficult problems in NP, in the sense that they are the ones most likely
not to be in P. Because the problem P = NP is not solved, being able to reduce a
known NPcomplete problem, 2, to ano
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Automata theory is a subject matter that studies properties of various types of
automata. For example, the following questions are studied about a given type of
automata.
Which class of formal languag
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
The field of Kolmogorov complexity and algorithmic randomness was developed
during the 1960s and 1970s by Chaitin, Kolmogorov, Levin, MartinLf and
Solomonoff (the names are given here in alphabetical
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Table 4: Transformation in Technology
1700  1900
1900  2000
2000 
Economics
Agriculture
Manufacture
Information
Technology
Plow
Machine
Computer
Output
Food
Good
Information
Resource
Land
Capital
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
On the other hand another medium that causes the death of distance is the diffusion of production into
the whole world. Currently, through FDI, MNCs have diffused their productions to many countries.
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
enumerable classes of functions are learnable while the class REC of all
computable functions is not learnable. Many related models have been considered
and also the learning of classes of recursively
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Julia Robinson) Matiyasevich's theorem, which implies that Hilbert's tenth
problem has no effective solution; this problem asked whether there is an effective
procedure to decide whether a Diophantine
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
age of the universe. Even with a much faster computer, the program would only be
useful for very small instances and in that sense the intractability of a problem is
somewhat independent of technologi
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
priority arguments can be technical and difficult to follow, it has traditionally been
considered desirable to prove results without priority arguments, or to see if
results proved with priority argum
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
is the range of some computable function. The recursively enumerable sets,
although not decidable in general, have been studied in detail in recursion theory.
Relative computability and the Turing deg
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
The integer factorization problem is the computational problem of determining
the prime factorization of a given integer. Phrased as a decision problem, it is the
problem of deciding whether the input
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Marshall McLuhan through global village conceptualization and Ohmae through crossborder
civilization definition designate the formation of global culture.
This resemblance certainly does not indicate
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Post also showed that some of them are strictly intermediate under other
reducibility notions stronger than Turing reducibility. But Post left open the main
problem of the existence of recursively enu
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
low performances. Countries that have low potentials and performances are generally those from Africa.
2.2.1.3. Production and Competitiveness
In recent years, global economy transformed with the elim
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
q0 is the start state, that is, the state of the automaton before any input
has been processed, where q0 Q.
F is a set of states of Q (i.e. FQ) called accept states.
Input word
An automaton reads a f
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Also w13 = w1w1w1
Languages
A language is a set of string all of which are chosen from some *, where is a
particular alphabet. This means that language L is subset of *. An example is
English language
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
China follow them. Although she is behind these countries, Turkey is a promising country with her
upward climb.
In the era of rapid globalization countries have incomes as much as they can compete. Th
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Third Stage (1990): In the first two stages instable balances aroused. The number of
independent states increased, conflicts increased and accelerated. Identity conflicts reached to
peak in the underd
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
These are used in text processing, compilers, and hardware design.
ContextFree Grammars.
These are used to define programming languages and in Artificial
Intelligence.
Turing Machines. These form a
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
companies. Volatile prices constitute high risks for both companies. In case of a vertical integration of
these two companies the problems will disappear or be relieved.
1.1.4.2. Theories of FDI
FDI s
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
countries are highincome countries. In the year 2006 Norway had the highest nominal income of
$66,530 and Burundi had the lowest $100. In that year the average income in the world was $7,439. If
the
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
Connection to category theory
One can define several distinct categories of automata[3] following the automata
classification into different types described in the previous section. The
mathematical c
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
of Michael O. Rabin and Anatoly Maltsev on algorithmic presentations of algebras,
and the negative solution to Hilbert's Tenth Problem. The more recent applications
include algorithmic randomness, res
Ma Ayesha Institute of Education and Allied Health Sciences
en
SDED 234

Winter 2016
each such copy starts running on one of the successor symbol from the state
according to the transition relation of the automaton. Such an automaton is
called a tree automaton.
Infinite tree input :