master algorithm generator 7 11 19

()formula finder with algorithms
- word2vec, patterns in texts, own version of machine learning

-> cawp without dictionary *: given master sentences as specs
program finder * x cawp will find more possibilities, x pf is more intuitive x it is like a broken down cawp dictionary
	- multiple predicates, multiple levels
	- type statements to verify predicates (with mode statements)
		- in types, modes verify format where mode statements apply to entry of predicate (as would anyway), are applied before running command and are used if included (i.e. have [n,modes] at start and types have [n,types]) - lpi uses type statements before running a command if modes are given to identify inputs, and also afterwards (but may not have reached this point if failed).
		find types
		1. give data with modes in it
		2. calculate modes
		3. mold types by starting with any
- check them because all possibilities are allowed, depth limit - 1 possibility per clause, collected per predicate later

()algorithms with data in the same format as other algorithms
- other algorithms as data