Call for Paper - August 2022 Edition
IJCA solicits original research papers for the August 2022 Edition. Last date of manuscript submission is July 20, 2022. Read More

Evolution and Exploratory Areas in the Field of Theoretical Computer Science

Print
PDF
IJCA Proceedings on National Conference on Contemporary Computing
© 2017 by IJCA Journal
NCCC 2016 - Number 2
Year of Publication: 2017
Authors:
Amit Shrivastava
Anand Rajavat

Amit Shrivastava and Anand Rajavat. Article: Evolution and Exploratory Areas in the Field of Theoretical Computer Science. IJCA Proceedings on National Conference on Contemporary Computing NCCC 2016(2):10-13, April 2017. Full text available. BibTeX

@article{key:article,
	author = {Amit Shrivastava and Anand Rajavat},
	title = {Article: Evolution and Exploratory Areas in the Field of Theoretical Computer Science},
	journal = {IJCA Proceedings on National Conference on Contemporary Computing},
	year = {2017},
	volume = {NCCC 2016},
	number = {2},
	pages = {10-13},
	month = {April},
	note = {Full text available}
}

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

  • P. Raatikainen, "Gdel's incompleteness theorems," in The Stanford Encyclopedia of Philosophy (E. N. Zalta, ed. ), spring 2015 ed. , 2015.
  • A. M. Turing, "On computable numbers, with an application to the entscheidungsproblem," J. of Math, vol. 58, no. 345-363, p. 5, 1936.
  • J. Hartmanis, "Observations about the development of theoretical computer science," Annals of the History of Computing, vol. 3, no. 1, pp. 42–51, 1981
  • 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.
  • U. Vazirani, "A survey of quantum complexity theory," inProceedings of Symposia in Applied Mathematics, vol. 58,pp. 193–220, 2002.
  • B. Lszl, "Mathematician claims breakthrough in complexity theory," sciencemag. org, 2015.
  • sigact, "Challenges for theoretical computer science," 2000
  • P. W. Shor, "Introduction to quantum algorithms," in Proceedings of Symposia in Applied Mathematics, vol. 58, pp. 143–160, 2002.
  • J. E. Savage, A. L. Selman, and C. Smith, "History andcontributions of theoretical computer science," Advances in Computers, vol. 55, pp. 171–183, 2002.
  • B. J. Copeland, "The church-turing thesis," in The Stanford Encyclopedia of Philosophy (E. N. Zalta, ed. ), summer 2015 ed. , 2015.
  • L. Fortnow and S. Homer, "A short history of computational complexity," Bulletin of the EATCS, vol. 80, pp. 95–133, 2003.
  • A. McGregor, "Graph stream algorithms: A survey," ACM SIGMOD Record, vol. 43, no. 1, pp. 9–20, 2014.