<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=BushBud</id>
	<title>Conservapedia - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=BushBud"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/Special:Contributions/BushBud"/>
	<updated>2026-09-24T00:56:32Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Undecidable&amp;diff=662933</id>
		<title>Undecidable</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Undecidable&amp;diff=662933"/>
		<updated>2009-05-14T00:51:56Z</updated>

		<summary type="html">&lt;p&gt;BushBud: Undecidability justifies faith&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;A statement in formal [[logic]] is called '''undecidable''' if there is no [[proof]] or [[disproof]] of the statement in formal logic. A common misconception is that undecidable statements have no truth value, but this statement is not true. For example, many set theorists now believe that the [[continuum hypothesis]] (which is known to be undeciable in [[Zermelo-Fraenkel]] set theory) is actually false.&lt;br /&gt;
&lt;br /&gt;
As a more concrete example, suppose we had a &amp;quot;theory of colored shapes&amp;quot; &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; where the objects were colored shapes (red triangles, blue squares, etc), and the possible [[atom]]ic sentences were of the form &amp;quot;shape &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; is a square.&amp;quot; Since we do not have the language to state &amp;quot;shape &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; is red&amp;quot; then any statement of this form is undecidable in &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt;, though it could be true or false in some larger theory &amp;lt;math&amp;gt;T'&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==Famous Undecidable Statements==&lt;br /&gt;
&lt;br /&gt;
* [[Axiom of Choice]]&lt;br /&gt;
* [[Banach-Tarski paradox]]&lt;br /&gt;
* [[Church-Turing thesis]]&lt;br /&gt;
* [[Continuum hypothesis]]&lt;br /&gt;
* Existence of large [[cardinal]]s&lt;br /&gt;
* [[Halting problem]]&lt;br /&gt;
* [[König's lemma]]&lt;br /&gt;
* [[Lefschetz principle]]&lt;br /&gt;
* [[Liar's paradox]]&lt;br /&gt;
* [[Ramsey theory]] involving infinite sets&lt;br /&gt;
* [[Russell's paradox]]&lt;br /&gt;
* [[Zeno's paradox]]&lt;br /&gt;
&lt;br /&gt;
[[category:logic]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Undecidability and God==&lt;br /&gt;
The theory of undecidability shows that the world cannot be guided by [[logic]] and [[rationality]] alone: Godel proved that there exist truths that can never be proven. This demonstrates the validity of [[faith]].&lt;/div&gt;</summary>
		<author><name>BushBud</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Computer_science&amp;diff=662932</id>
		<title>Computer science</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Computer_science&amp;diff=662932"/>
		<updated>2009-05-14T00:48:33Z</updated>

		<summary type="html">&lt;p&gt;BushBud: Fixed link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''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.&lt;br /&gt;
&lt;br /&gt;
Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.&lt;br /&gt;
&lt;br /&gt;
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. &lt;br /&gt;
&lt;br /&gt;
==Liberal Bias in Computer Science==&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
==Common programming languages in Computer Science==&lt;br /&gt;
*[[Java]]&lt;br /&gt;
*[[C++|C/C++]]&lt;br /&gt;
*[[Matlab]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Information technology]]&lt;br /&gt;
[[Category:Computer Science]]&lt;/div&gt;</summary>
		<author><name>BushBud</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Computer_science&amp;diff=662931</id>
		<title>Computer science</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Computer_science&amp;diff=662931"/>
		<updated>2009-05-14T00:47:56Z</updated>

		<summary type="html">&lt;p&gt;BushBud: Added section about liberal bias in computer science&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''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.&lt;br /&gt;
&lt;br /&gt;
Studies can range from the very practical, such as learning [[programming language]]s, to the highly theoretical.&lt;br /&gt;
&lt;br /&gt;
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. &lt;br /&gt;
&lt;br /&gt;
==Liberal Bias in Computer Science==&lt;br /&gt;
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 algorithms]], 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.&lt;br /&gt;
&lt;br /&gt;
==Common programming languages in Computer Science==&lt;br /&gt;
*[[Java]]&lt;br /&gt;
*[[C++|C/C++]]&lt;br /&gt;
*[[Matlab]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Information technology]]&lt;br /&gt;
[[Category:Computer Science]]&lt;/div&gt;</summary>
		<author><name>BushBud</name></author>
	</entry>
</feed>