CFP last date
22 July 2024
Reseach Article

Evolution and Exploratory Areas in the Field of Theoretical Computer Science

Published on April 2017 by Amit Shrivastava, Anand Rajavat
National Conference on Contemporary Computing
Foundation of Computer Science USA
NCCC2016 - Number 2
April 2017
Authors: Amit Shrivastava, Anand Rajavat
218cdaca-3176-47eb-8a9a-153ff600d6a1

Amit Shrivastava, Anand Rajavat . Evolution and Exploratory Areas in the Field of Theoretical Computer Science. National Conference on Contemporary Computing. NCCC2016, 2 (April 2017), 10-13.

@article{
author = { Amit Shrivastava, Anand Rajavat },
title = { Evolution and Exploratory Areas in the Field of Theoretical Computer Science },
journal = { National Conference on Contemporary Computing },
issue_date = { April 2017 },
volume = { NCCC2016 },
number = { 2 },
month = { April },
year = { 2017 },
issn = 0975-8887,
pages = { 10-13 },
numpages = 4,
url = { /proceedings/nccc2016/number2/27342-6346/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Contemporary Computing
%A Amit Shrivastava
%A Anand Rajavat
%T Evolution and Exploratory Areas in the Field of Theoretical Computer Science
%J National Conference on Contemporary Computing
%@ 0975-8887
%V NCCC2016
%N 2
%P 10-13
%D 2017
%I International Journal of Computer Applications
Abstract

Theoretical computer science (TCS) is vast and ever evolving area in every field of engineering and has also immense impact over large domain of science. "Church-Turing" thesis was basis for the abstract computational logic. In 60s computational complexity came out as new research interest. In the domain of Biological computation, TCS has strengthen the on going research in many areas such as DNA sequencing, Protein folding, Brain comprehension. This Paper has tried to knock the opportunity and learning of TCS research domain. It will help in realizing the domain of theoretical computer science along with its evolution and emerging trends. It will give the insight in perceiving problems and thus help in providing better alternative solutions for growth research field in TCS.

References
  1. P. Raatikainen, "Gdel's incompleteness theorems," in The Stanford Encyclopedia of Philosophy (E. N. Zalta, ed. ), spring 2015 ed. , 2015.
  2. A. M. Turing, "On computable numbers, with an application to the entscheidungsproblem," J. of Math, vol. 58, no. 345-363, p. 5, 1936.
  3. J. Hartmanis, "Observations about the development of theoretical computer science," Annals of the History of Computing, vol. 3, no. 1, pp. 42–51, 1981
  4. S. -S. Li, G. -L. Long, F. -S. Bai, S. -L. Feng, and H. -Z. Zheng, "Quantum computing," Proceedings of the National Academy of Sciences, vol. 98, no. 21, pp. 11847–11848, 2001.
  5. U. Vazirani, "A survey of quantum complexity theory," inProceedings of Symposia in Applied Mathematics, vol. 58,pp. 193–220, 2002.
  6. B. Lszl, "Mathematician claims breakthrough in complexity theory," sciencemag. org, 2015.
  7. sigact, "Challenges for theoretical computer science," 2000
  8. P. W. Shor, "Introduction to quantum algorithms," in Proceedings of Symposia in Applied Mathematics, vol. 58, pp. 143–160, 2002.
  9. J. E. Savage, A. L. Selman, and C. Smith, "History andcontributions of theoretical computer science," Advances in Computers, vol. 55, pp. 171–183, 2002.
  10. B. J. Copeland, "The church-turing thesis," in The Stanford Encyclopedia of Philosophy (E. N. Zalta, ed. ), summer 2015 ed. , 2015.
  11. L. Fortnow and S. Homer, "A short history of computational complexity," Bulletin of the EATCS, vol. 80, pp. 95–133, 2003.
  12. A. McGregor, "Graph stream algorithms: A survey," ACM SIGMOD Record, vol. 43, no. 1, pp. 9–20, 2014.
Index Terms

Computer Science
Information Sciences

Keywords

Theoretical Computer Science Computational Complexity Computing.