From 6a826966a1f8f15357a6b771777ea4b799f3aa8c Mon Sep 17 00:00:00 2001 From: LSaldyt Date: Sat, 9 Dec 2017 18:44:25 -0700 Subject: [PATCH] Spell checks draft.tex, adds sources --- papers/Makefile | 3 ++- papers/draft.tex | 13 ++++++------- papers/sources.bib | 9 --------- 3 files changed, 8 insertions(+), 17 deletions(-) diff --git a/papers/Makefile b/papers/Makefile index ce6a77e..c6e2513 100644 --- a/papers/Makefile +++ b/papers/Makefile @@ -1,6 +1,7 @@ all: - draft + make draft + make clean draft: pdflatex draft.tex diff --git a/papers/draft.tex b/papers/draft.tex index e7aeaa5..29ae9fe 100644 --- a/papers/draft.tex +++ b/papers/draft.tex @@ -39,8 +39,7 @@ Based on this cross-comparison, [Result Summary]. \section{Introduction} -This paper stems from Melanie Mitchell's (1993) and Douglas Hofstadter's \& FARG's (1995) work on the copycat program. -\cite{geb} +This paper stems from Melanie Mitchell's \cite{analogyasperception} and Douglas Hofstadter's \& FARG's \cite{fluidconcepts} work on the copycat program. This project focuses on effectively simulating intelligent processes through increasingly distributed decision-making. In the process of evaluating the distributed nature of copycat, this paper also proposes a "Normal Science" framework. Copycat's behavior is based on the "Parallel Terraced Scan," a humanistic-inspired search algorithm. @@ -118,9 +117,9 @@ Then, desirability of answer distributions can be found as well, and the followi Note that this is more similar to the behavior of a GPU than a CPU. This model doesn't work when code has to synchronize to access global variables. - Notably, however, functional distributed code is turing complete just like imperative centralized code is turing complete. + Notably, however, functional distributed code is Turing complete just like imperative centralized code is Turing complete. Especially given the speed of modern computers, functional code cannot do anything that imperative code can't. - However, working in a mental framework that models the functionality of the human brain may assist in actually modelling its processes. + However, working in a mental framework that models the functionality of the human brain may assist in actually modeling its processes. \subsubsection{Local Descriptions} @@ -174,7 +173,7 @@ Then, desirability of answer distributions can be found as well, and the followi The remainder of the section discusses different formulas and their advantages/disadvantages. Also, as a general rule, changing these formulas causes copycat to produce statistically significantly different answer distributions. - The original formula for curving probabilties in copycat: + The original formula for curving probabilities in copycat: \lstinputlisting[language=Python]{resources/original.py} An alternative that seems to improve performance on the "abd:abd::xyz:\_" problem: @@ -223,7 +222,7 @@ Then, desirability of answer distributions can be found as well, and the followi Then, breaker-fizzling, an independent temperature-related feature was removed from the original branch and another $\chi^2$ comparison was made. The same process was repeated for non-probability temperature-based adjustments, and then for the copycat stopping decision. Then, a temperature-less branch of the repository was created and tested. - Then, a branch of the repostory was created that removed probability adjustments, value adjustments, and fizzling, and made all other temperature-related operations use a dynamic temperature calculation. + Then, a branch of the repository was created that removed probability adjustments, value adjustments, and fizzling, and made all other temperature-related operations use a dynamic temperature calculation. All repository branches were then cross compared using a $\chi^2$ distribution test. \subsection{$\chi^2$ Distribution Testing} @@ -273,7 +272,7 @@ Then, desirability of answer distributions can be found as well, and the followi \subsection{Prediction} - Even though imperative, serial, centralized code is turing complete just like functional, parallel, distributed code, I predict that the most progressive cognitive architectures of the future will be created using functional programming languages that run distributedly and in true parallel. + Even though imperative, serial, centralized code is Turing complete just like functional, parallel, distributed code, I predict that the most progressive cognitive architectures of the future will be created using functional programming languages that run distributively and in true parallel. I also predict that, eventually, distributed code will be run on hardware closer to the architecture of a GPU than of a CPU. \printbibliography diff --git a/papers/sources.bib b/papers/sources.bib index 157d10e..56fdbf5 100644 --- a/papers/sources.bib +++ b/papers/sources.bib @@ -39,12 +39,3 @@ url = "http://www-cs-faculty.stanford.edu/~uno/abcde.html", keywords = "latex,knuth" } - -@inbook{knuth-fa, - author = "Donald E. Knuth", - title = "Fundamental Algorithms", - publisher = "Addison-Wesley", - year = "1973", - chapter = "1.2", - keywords = "knuth,programming" -}