The Algorithm Writer with Lists includes three algorithms, the first of which runs randomly chosen algorithms (e.g. reverse, append, minus, intersection and list of duplicated elements in 2 lists) on vaguely mind read chosen data from the Text to Breasoning (T2B) dictionary, the second of which does the same thing but randomly chooses the data not mind reads it and the third of which (contrary to its name) doesn't use logic (but does include "and" in the ignored connector list), but finds combinations of words in a sentence with random words from the T2B dictionary and suggests an algorithm which connects the words in a chain of lists.
The algorithm, despite its obvious simplicity, is a compromise and solution of possibly erroneous similar algorithms, in that it can be used by post-graduate students and above to generate pedagogical requirements (e.g. 50 details per sentence, divided into 10 area of study, 10 seen-as version, 10 comments, 10 Bs (disagreeing sentences) and 10 B solutions, and 2*50 As (where there are 80 breasonings, or details per A) in a PhD).
Comparison with CAWMP
Algorithm Writer with Lists is simpler than laboriously writing 10 algorithms for sentences each with 50 As for details in a thesis as CAWMP (Combination Algorithm Writer with Multiple Predicates) could help do. CAWMP writes algorithms based on specifications, rather than no specification, and is useful for code uniformisation and the encouragement of examination and the writing of an algorithm that can convert sentences into specifications.