Computer science - Revision history

Yeschayi: Undo revision 1743862 by RedStateVoter (talk) Vandalism

2021-04-13T18:13:14Z

Undo revision 1743862 by RedStateVoter (talk) Vandalism

RedStateVoter: Blanked the page

2021-04-13T17:51:47Z

Blanked the page

DavidB4: category tweak (manual of style)

2016-03-31T13:12:30Z

category tweak (manual of style)

RolandPlankton: rephrase to avoid redirect

2012-02-04T16:31:10Z

rephrase to avoid redirect

Pmgarvey: added some info on algorithms, and the pioneers of the subject

2011-06-10T21:46:59Z

added some info on algorithms, and the pioneers of the subject

Tzoran at 15:21, March 21, 2010

2010-03-21T15:21:25Z

Aroth: A brief description of theoretical computer science

2009-09-13T17:38:24Z

A brief description of theoretical computer science

Canuck: /* Common programming languages in Computer Science */ add c#

2009-08-25T04:06:38Z

Common programming languages in Computer Science: add c#

Hsmom: Changed wording.

2009-05-19T02:14:39Z

Changed wording.

Conservative: Reverted edits by BushBud (Talk) to last version by Foxtrot

2009-05-14T00:55:12Z

Reverted edits by BushBud (Talk) to last version by Foxtrot

← Older revision	Revision as of 18:13, April 13, 2021
Line 1:	Line 1:
	+	'''Computer science''' is the study of various aspects of [[computer]]s. It is a common course of study and degrees at the college level and beyond.

	+	Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.
	+
	+	Students who plan to study computer science should take as many [[mathematics]] courses as possible. While not all of computer science is directly mathematical, the mental discipline that comes from studying math is very useful in studying computers. Computer Science was originally (and still by some) viewed as a branch of mathematics, the earliest discoveries in the discipline being made by mathematicians. Some of the earliest pioneers were [[Alan Turing]], [[Alonzo Church]] and [[John von Neumann]], all mathematicians.
	+
	+
	+	==Algorithms==
	+	An [[algorithm]] is the fundamental concept of Computer Science. An algorithm is simply a finite set of instructions to accomplish any task. A computer is simply a machine to carry out algorithms so you don't have to. The [[MIT]] book, Introduction to Algorithms, is viewed as the canonical basic reference and would be good for anyone interested. It is however expensive.
	+
	+	==Common programming languages in Computer Science==
	+	*[[Java]]
	+	*[[C++\|C/C++]]
	+	*[[C#]]
	+	*[[Python]], and its [[Java]] implementation [[Jython]]
	+	*[[Matlab]]
	+
	+	==Theoretical Computer Science==
	+	[[Theoretical computer science]] is the mathematical study of what can and cannot in principle be computed under various constraints. For example, [[Alan Turing]] [[halting problem\|proved]] that it is impossible to write a computer program that can determine whether other computer programs will ever ''halt'', or whether they will run forever. Other problems which can be solved in principle seem impossible to solve efficiently. For example, the famous P vs. NP problem asks whether there exists a polynomial time algorithm to solve any NP-complete problem, like the [[travelling salesman problem]]. There is a $1,000,000 prize for the solution to the P vs. NP problem.
	+
	+	[[Category:Information Technology]]
	+	[[Category:Computer Science]]

← Older revision		Revision as of 17:51, April 13, 2021
Line 1:		Line 1:
−	~~'''Computer science''' is the study of various aspects of [[computer]]s. It is a common course of study and degrees at the college level and beyond.~~

−	~~Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.~~
−
−	Students who plan to study computer science should take as many [[mathematics]] courses as possible. While not all of computer science is directly mathematical, the mental discipline that comes from studying math is very useful in studying computers. Computer Science was originally (and still by some) viewed as a branch of mathematics, the earliest discoveries in the discipline being made by mathematicians. Some of the earliest pioneers were [[Alan Turing]], [[Alonzo Church]] and [[John von Neumann]], all mathematicians.
−
−
−	~~==Algorithms==~~
−	An [[algorithm]] is the fundamental concept of Computer Science. An algorithm is simply a finite set of instructions to accomplish any task. A computer is simply a machine to carry out algorithms so you don't have to. The [[MIT]] book, Introduction to Algorithms, is viewed as the canonical basic reference and would be good for anyone interested. It is however expensive.
−
−	~~==Common programming languages in Computer Science==~~
−	*[[Java]]
−	*[[C++\|C/C++]]
−	*[[C#]]
−	*[[Python]], and its [[Java]] implementation [[Jython]]
−	*[[Matlab]]
−
−	~~==Theoretical Computer Science==~~
−	[[Theoretical computer science]] is the mathematical study of what can and cannot in principle be computed under various constraints. For example, [[Alan Turing]] [[halting problem\|proved]] that it is impossible to write a computer program that can determine whether other computer programs will ever ''halt'', or whether they will run forever. Other problems which can be solved in principle seem impossible to solve efficiently. For example, the famous P vs. NP problem asks whether there exists a polynomial time algorithm to solve any NP-complete problem, like the [[travelling salesman problem]]. There is a $1,000,000 prize for the solution to the P vs. NP problem.
−
−	~~[[Category:Information Technology]]~~
−	~~[[Category:Computer Science]]~~

@@ Line 19: / Line 19: @@
 [[Theoretical computer science]] is the mathematical study of what can and cannot in principle be computed under various constraints. For example, [[Alan Turing]] [[halting problem|proved]] that it is impossible to write a computer program that can determine whether other computer programs will ever ''halt'', or whether they will run forever. Other problems which can be solved in principle seem impossible to solve efficiently. For example, the famous P vs. NP problem asks whether there exists a polynomial time algorithm to solve any NP-complete problem, like the [[travelling salesman problem]]. There is a $1,000,000 prize for the solution to the P vs. NP problem.
-[[Category:Information technology]]
+[[Category:Information Technology]]
 [[Category:Computer Science]]

← Older revision		Revision as of 16:31, February 4, 2012
Line 1:		Line 1:
−	'''Computer science''' is the study of various aspects of [[~~computers~~]]. It is a common course of study and degrees at the college level and beyond.	+	'''Computer science''' is the study of various aspects of [[computer]]s. It is a common course of study and degrees at the college level and beyond.

	Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.		Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.

@@ Line 3: / Line 3: @@
 Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.
-Students who plan to study computer science should take as many [[mathematics]] courses as possible. While not all of computer science is directly mathematical, the mental discipline that comes from studying math is very useful in studying computers.
+Students who plan to study computer science should take as many [[mathematics]] courses as possible. While not all of computer science is directly mathematical, the mental discipline that comes from studying math is very useful in studying computers. Computer Science was originally (and still by some) viewed as a branch of mathematics, the earliest discoveries in the discipline being made by mathematicians. Some of the earliest pioneers were [[Alan Turing]], [[Alonzo Church]] and [[John von Neumann]], all mathematicians.
 ==Common programming languages in Computer Science==
@@ Line 13: / Line 17: @@
 ==Theoretical Computer Science==
-[[Theoretical computer science]] is the mathematical study of what can and cannot in principle be computed under various constraints. For example, [[Alan Turing]] proved that it is impossible to write a computer program that can determine whether other computer programs will ever ''halt'', or whether they will run forever. Other problems which can be solved in principle seem impossible to solve efficiently. For example, the famous P vs. NP problem asks whether there exists a polynomial time algorithm to solve any NP-complete problem, like the [[travelling salesman problem]]. There is a $1,000,000 prize for the solution to the P vs. NP problem.
+[[Theoretical computer science]] is the mathematical study of what can and cannot in principle be computed under various constraints. For example, [[Alan Turing]] [[halting problem|proved]] that it is impossible to write a computer program that can determine whether other computer programs will ever ''halt'', or whether they will run forever. Other problems which can be solved in principle seem impossible to solve efficiently. For example, the famous P vs. NP problem asks whether there exists a polynomial time algorithm to solve any NP-complete problem, like the [[travelling salesman problem]]. There is a $1,000,000 prize for the solution to the P vs. NP problem.
 [[Category:Information technology]]
 [[Category:Computer Science]]

@@ Line 9: / Line 9: @@
 *[[C++|C/C++]]
 *[[C#]]
 *[[Matlab]]

← Older revision		Revision as of 02:14, May 19, 2009
Line 1:		Line 1:
−	'''Computer science''' is the study of various aspects of [[computers]]. It is a common ~~source~~ of study and degrees at the college level and beyond.	+	'''Computer science''' is the study of various aspects of [[computers]]. It is a common course of study and degrees at the college level and beyond.

	Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.		Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.

← Older revision		Revision as of 00:55, May 14, 2009
Line 4:		Line 4:

	Students who plan to study computer science should take as many [[mathematics]] courses as possible. While not all of computer science is directly mathematical, the mental discipline that comes from studying math is very useful in studying computers.		Students who plan to study computer science should take as many [[mathematics]] courses as possible. While not all of computer science is directly mathematical, the mental discipline that comes from studying math is very useful in studying computers.
−
−	~~==Liberal Bias in Computer Science==~~
−	Like many areas of [[academia]], computer science is dominated by [[liberal]]s. The field of computer science was founded by [[homosexual]] [[Alan Turing]]. This often guides research, such as investigations into [[genetic algorithms]] and [[evolutionary algorithm]]s, based on the [[liberal]] [[theory of evolution]]. The field of [[artificial intelligence]] seeks to deny the supremacy of God, by attempting to create man-made intelligent life. The failure of [[artificial intelligence]] and [[genetic algorithms]] can be seen as proof that this [[liberal]] world-view is wrong.

	==Common programming languages in Computer Science==		==Common programming languages in Computer Science==