Essay Helper | Text-to-Breasonings (Helps Earn High Distinctions) | Grammar Logic (Helps Mind Map Details)
Generates random algorithms in List Prolog, which can be converted to a simple form similar to Prolog.
- algwriter-lists-mr.pl - generates algorithms with combinations of other algorithms with vague mind reading
- algwriter-lists-random.pl - generates algorithms with combinations of other algorithms at random
- grammar_logic_to_alg.pl - takes text, randomly generates details and appropriate algorithms for A (agreement), B (disagreement) and solution to B based on approximate parts of speech and the Text to Breasonings dictionary.
- random_dependencies.pl - generates random (meaningless) algorithm specifications.
- combophil.pl - finds combinations of lines to write philosophies about.
- combophil_grammar_logic_to_alg.pl - finds all combinations in lines to write philosophies and does what grammar_logic_to_alg.pl (above) does.
- four_crosses.pl - finds 4 crosses to transition to PhD refinement.
- combophil2qadb.pl - generates algorithms from dictionary.
- mr_alg.pl and ya_phil_to_alg.pl - Yet Another Philosophy to Algorithm and Mind Read Algorithm (randomly produces 5 line algorithms with type checking, possibly about Lucian Academy philosophies).
Please contact Lucian Green at luciangreen@lucianacademy.com with questions, comments and feedback about Algorithm Writer with Lists.
Please read the following instructions on how to install the project on your computer for generating algorithms.
- Please download and install SWI-Prolog for your machine at
https://www.swi-prolog.org/build/
.
Download this repository, the List Prolog Interpreter Repository and the Text to Breasonings Repository.
- Download the LPPM Repository:
mkdir GitHub
cd GitHub/
git clone https://github.com/luciangreen/List-Prolog-Package-Manager.git
cd List-Prolog-Package-Manager
swipl
['lppm'].
lppm_install("luciangreen","Algorithm-Writer-with-Lists").
../
halt.
follow instructions in Instructions for Using texttobr(2) when using texttobr, texttobr2 or mind reader to avoid medical problems.
-
In Shell:
cd Algorithm-Writer-with-Lists
swipl
['algwriter-lists-mr.pl'].
-
Enter
algwriter(Algorithm),writeln1(Algorithm).
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['algwriter-lists-random.pl'].
- Enter
algwriter(Algorithm),writeln1(Algorithm).
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['grammar_logic_to_alg.pl'].
-
Enter sentences and lines to randomly process to give details and algorithms to into
"file.txt"
in the"Text-to-Breasonings"
folder. The output or thegla.txt
file, depending on whether you run using (1) or (2) in the following will contain the sentences and algorithms with instructions about how to run them. -
Enter
grammar_logic_to_alg1.
(1) or paste the contents ofgrammar_logic_to_alg_sh.txt
into the Terminal window on Mac (2).
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['random_dependencies.pl'].
-
As stated above, the value of this algorithm's input is found by mentally inserting not and transformations.
-
Enter
random_dependencies(A),writeln1(A).
[substring,[[duplicates,[[]]],[findall,[[add_number_to_list,[[split_into_sentences,[[sort,[[list_head,[[reverse,[[findall,[[string_to_list,[[or,[[and,[[delete,[[map,[[]]]]],[]]]]]]]]]]]]],[map,[[length,[[maximum,[[length,[[reverse,[[split_into_sentences,[[member,[[map,[[]]]]]]],[]]]]]]],[delete,[[get_item_n,[[],[and,[[]]]]],[reverse,[[]]]]]]],[]]]]]]]]]]]]]
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['combophil.pl'].
-
Finds combinations of lines to write philosophies about with e.g. a combination of 2 lines:
-
Enter
combophil(2).
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['combophil_grammar_logic_to_alg.pl'].
-
Enter sentences and lines to intermix (warning: takes all combinations of verbs and non verbs in file) and randomly process to give details and algorithms to into
"file.txt"
in the"Text-to-Breasonings"
folder. The output in the following will contain the sentences and algorithms with instructions about how to run them. -
Enter
combophil_grammar_logic_to_alg1.
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['four_crosses.pl'].
-
Enter four levels of crosses of ideas to make a PhD-level connection.
-
Enter
four_crosses.
- Converts files from e.g. grammar_logic_to_alg.pl to simplified algorithms with more specific command names. Breason out file.txt using Text-to-Breasonings, run grammar_logic_to_alg.pl, run grammar_logic_to_alg2.pl, then run Text-to-Breasonings Reading Algorithm on the grammar_logic_to_alg2.pl output.
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['grammar_logic_to_alg2.pl'].
-
Enter the number of words in file.txt to replace with computational language (it learns as it goes).
-
Enter
grammar_logic_to_alg2(200).
- Generates algorithms in qadb format from word dictionary.
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['combophil2qadb.pl'].
- Enter
.
or\n
delimited algorithm ideas inText-to-Breasonings/file.txt
and enter:combophil2qadb.
- Produces algorithms in
file-o.txt
.
- Download this repository.
- In SWI-Prolog, in the
"Algorithm-Writer-with-Lists"
folder, enter:
['ya_phil_to_alg.pl.pl'].
-
As stated above, Yet Another Philosophy to Algorithm randomly produces 5 line algorithms with type checking about all sentences in
Lucian-Academy/
. -
Enter
ya_phil_to_alg.
-
Produces the file
yet_more_phil_algs.txt
, containing, for example:
...n,length,list,number,n,round,number,number,n,sqrt,number,number,n,sqrt,number,number,n,round,number,number,n,sqrt,number,number...
-
To produce one five-line algorithm, enter
mr_alg(Commands).
, producing: -
Commands = [[[n,member],[[list],[_3386]]],[[n,member],[[list],[list]]],[[n,intersection],[[list],[list]]],[[n,member],[[list],[_5928]]],[[n,atom_string],[[atom],[string]]],[[n,string_length],[[string],[number]]]]
, -
where this algorithm means, "Take a member (the second item, the first output of member) of a list, take a member list of this list, etc.".
-
Note: member(List,Item) is now member(Item,List) in List Prolog, which is different from the above.
Lucian Green - Initial programmer - Lucian Academy
I licensed this project under the BSD3 License - see the LICENSE.md file for details