# A report on Computer science, Mathematics and Algorithm

In mathematics and computer science, an algorithm is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation.

- AlgorithmComputer science spans theoretical disciplines (such as algorithms, theory of computation, information theory and automation) to practical disciplines (including the design and implementation of hardware and software).

- Computer scienceMathematics is essential in many fields, including natural sciences, engineering, medicine, finance, computer science and social sciences.

- MathematicsComputer science research also often intersects other disciplines, such as cognitive science, linguistics, mathematics, physics, biology, Earth science, statistics, philosophy, and logic.

- Computer scienceAlgorithms - especially their implementation and computational complexity - play a major role in discrete mathematics.

- Mathematics2 related topics with Alpha

## Cryptography

0 linksPractice and study of techniques for secure communication in the presence of adversarial behavior.

Practice and study of techniques for secure communication in the presence of adversarial behavior.

Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, electrical engineering, communication science, and physics.

Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in actual practice by any adversary.

## Computability theory

0 linksComputability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.

Nowadays these are often considered as a single hypothesis, the Church–Turing thesis, which states that any function that is computable by an algorithm is a computable function.

Many problems in mathematics have been shown to be undecidable after these initial examples were established.