Theoretical Computer Science
Alex, Hailin, Henry, and Ivan
It is less demonstrative
What is Theoretical in nature and focuses
more on theory.
Computer Science?
Theoretical Computer Science is a
branch of computer science that
combines the mathematical
aspects, and focuses mainly on that.
A category in this
part of tcs
- Theoretical Computer Science is the
mathematical basis for creating and
studying algorithms used many types of
Uses of Theoretical applications, such as , search engines,
databases, network routing, and
Computer Science
cryptography.
- TCS has played a central role in the
Uses of Theoretical creation of the fields of quantum
computation, and many types of
Computer Science algorithmic equations.
Pt. 2 - Even though TCS has been around for
almost 80 years now, it is still a topic that
has still yet to be uncovered. We think that
tcs is set to make many significant
contributions and several impactful
changes into the coming future setting us
up for the applications of quantum
computing and many more.
-
Algorithms
A series of steps used to solve a Algorithms are a set of instructions,
problem or accomplish a task. and in this case, given to a computer
to do. Before people would write a set
of instructions for a computer, but as
problems get more complicated it gets
harder for a human to write, and so it
lets the computer learn on its own.
Examples: Youtube, Tiktok, twitter,
etc.
Quantum
Computation
A type of computation that uses the
principles of quantum mechanics to process
information. In other words, quantum
computers use quantum bits or qubits,
which can represent both 0 and 1
simultaneously, unlike classical computers,
which use bits as the basic unit of
information (0 or 1)
History of Theoretical Computer Science P.1
Early Foundations Emergence of FLAT Complexity Theory & Algorithms
Alan Turing develops concept of Noam Chomsky publishes "Three Stephen Cook introduce concept
Turing machine in his paper “On models for the description of of NP-completeness, a landmark
Computable Numbers”. language," introducing result in complexity theory.
context-free grammars.
1940s 1960 1982
1930s 1956 1971
Early Foundations Emergence of FLAT Cryptography & Theoretical
Advances
John von Neumann's work on John Backus develops first
architecture of stored-program high-level programming Adi Shamir, Ron Rivest, and
computers lays foundation for language, Fortran. Leonard Adleman invent RSA
modern computer architecture. encryption algorithm, laying the
foundation for modern
cryptography.
History of Theoretical Computer Science P.2
Cryptography & Theoretical Quantum Computing & P vs. NP Ongoing Advancements &
Advances Expansions
Andrew Wiles proved Fermat's
Leslie Valiant introduces concept Last Theorem using advanced Peter Higgs and François Englert
of PAC learning in machine mathematical techniques. awarded Nobel Prize in Physics
learning theory. for work on the Higgs boson.
1994 2002 2020s
1987 1997 2012
Quantum Computing & P vs. NP Ongoing Advancements & Ongoing Advancements &
Expansions Expansions
Peter Shor develops Shor's
algorithm, a quantum algorithm Shafi Goldwasser and Silvio Theoretical computer science
that can efficiently factor large Micali receive Turing Award for continues to evolve, with
numbers. their work in cryptography and advancements in quantum
complexity theory. computing, machine learning,
and cryptography.
What might this technology look like in 10 years?
● Quantum cryptography
○ Quantum cryptography being able to decrypt data
keys much faster than Any traditional computer
○ Quantum cryptography explained Video
○ Quantum cryptography will be used by many
governments files to ensure security as quantum
cryptography becomes more accessible to countries
○ Vpn’s using quantum cryptography when it becomes
more mainstream
What might this technology look like in 10 years?
● AI Development into our lives
○ Microsoft investing 10 BILLION dollars into OpenAi to advance the technology of
artificial intelligence
○ Google making bard as a competitor to OpenAi
○ Open Ai working on better and more function ai with gbt-5 as just the beginning
○ New Era of Ai aiding humans in daily tasks just like the uprising of technology
○ Humans becoming dependent on Ai for anything just as phones did
CISA Cryptography standards
[Link] Quantum cryptography news
CNBC Microsoft investment in AI
Cited sources
New York Times microsoft investment in AI
[Link] quantum cryptography
explained
[Link] what makes quantum
computers so powerful problem solvers
Video
[Link] uncertain principle
Sources
Turing, A. M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem."
[Link]
Chomsky, N. (1956). "Three models for the description of language."
[Link]
Cook, S. A. (1971). "The Complexity of Theorem-Proving Procedures."
[Link]
Shor, P. W. (1994). "Algorithms for Quantum Computation: Discrete Logarithms and Factoring."
[Link]
Knuth, D. E. (1997). "The Art of Computer Programming, Volume 1: Fundamental Algorithms."
Addison-Wesley.
ALL CITED USING “SCRIBBR”
Sources (Pictures)
[Link]
58418329ec_z.jpg
[Link]
[Link]/1920px-Von_Neumann_Architecture.[Link]
[Link]
[Link]
07_1920-[Link]
[Link]