Theory of computation aims to understand the nature of efficient computation by dealing with how problems can be solved on a model of computation using an algorithm. It is mainly concerned with the study of how problems can be solved using algorithms. Computer scientists work using a model of computation to solve problems and prove results about computability. Automata theory, a field of study within theory of computation, studies abstract machines and the problems that can be solved using these machines.

1. Theory
of Computation

2. Most importantly, it aims to understand the
nature of efficient computation.
In theoretical computer science and
mathematics, the theory of computation is
the branch that deals with how efficiently
problems can be solved on a model of
computation, using an algorithm.

3. WHAT IS ALGORITHMS?
 algorithms are often created as functions.
 These functions serve as small programs that can be referenced by
a larger program. Example, an image viewing application may
include a library of functions that each use a custom algorithm to
render different image file formats. An image editing program may
contain algorithms designed to process image data. Examples of
image processing algorithms include cropping, resizing, sharpening,
blurring, red-eye reduction, and color enhancement.

4. Sorting in Java
(4) four different ways to sort data in Java
Arrays of primitives
An array of primitives is sorted by direct invocation of Arrays.sort method
int[] a1 = {3,4,1,5,2,6};
Arrays.sort(a1);
Arrays of objects
In order to sort an array of abstract object, we have to make sure that
objects are mutually comparable. The idea of comparable is extension of equals
in a sence than we need to know not only that two objects are not equal but which
one is larger or smaller. This is supported by the Comparable interface. This
interface contains only one method with the following signature:

5. public int compareTo(Object obj);
The returned value is negative, zero or positive depending on whether this
object is less, equals or greater than parameter object. Note a difference
between the equals() and compareTo() methods. In the following code
example we design a class of playing cards that can be compared based
on their values:

6. class Card implements Comparable<Card>
{
private String suit;
private int value;
public Card(String suit, int value)
{
this.suit = suit;
this.value = value;
}
public int getValue()
{
return value;
}
public String getSuit()
{
return suit;
}
public int compareTo(Card x)
{
return getValue() - x.getValue();
}
}

7. Theory of computation is mainly concerned with
the study of how problems can be solved using
algorithms.
Therefore, we can infer that it is very relevant to
the study of logic and mainly logic within mathematics. ...
In this specific field of study, computer scientists work
using a model of computation.

8. Automata theory is the study of abstract
machines (or more appropriately, abstract
mathematical‘ machines or systems) and
the computational problems that can be
solved using these machines. Automata are
used as theoretical models for computing
machines, and are used for proofs about
computability.

9. Real world applications of theory of computation in real
time. There are a lot of real time systems which are safety critical and
thus we can not just rely on testing for correctness of such systems. ...
For example, a time automaton or a push down timed system or a
timing dharam etc.

10. Activity