19. A computer implemented method in accordance with claim 2 wherein said method further comprises the steps of: a) Receiving said ill-defined problem domain of claim 18 , a set of SLT rules and higher order SLT rules derived from said ill-defined domain, wherein each said SLT rule has been made executable on a computer, and a set of problems, wherein said problem domain includes problems that cannot be solved by any one said higher or lower order SLT rule, b) Selecting a problem in said problem domain in step a), c) When said problem selected in step b) is solvable by one said SLT rule, providing tutoring on said problem in accordance with steps b) through l) in claim 2 , d) When said problem is solvable by exactly one of no said SLT rule and more than one said SLT rule, selecting one said higher order SLT rule in step a), wherein the range of said higher order SLT rule contains exactly one SLT rule that does solve said problem, and applying said higher order SLT rule to available SLT rules to generate a new SLT rule in said range, e) When said new SLT rule solves said problem, executing said new SLT rule on said problem.
19. A computer implemented method in accordance with claim 2 wherein said method further comprises the steps of: a) Receiving said ill-defined problem domain of claim 18 , a set of SLT rules and higher order SLT rules derived from said ill-defined domain, wherein each said SLT rule has been made executable on a computer, and a set of problems, wherein said problem domain includes problems that cannot be solved by any one said higher or lower order SLT rule, b) Selecting a problem in said problem domain in step a), c) When said problem selected in step b) is solvable by one said SLT rule, providing tutoring on said problem in accordance with steps b) through l) in claim 2 , d) When said problem is solvable by exactly one of no said SLT rule and more than one said SLT rule, selecting one said higher order SLT rule in step a), wherein the range of said higher order SLT rule contains exactly one SLT rule that does solve said problem, and applying said higher order SLT rule to available SLT rules to generate a new SLT rule in said range, e) When said new SLT rule solves said problem, executing said new SLT rule on said problem. 21. A computer implemented method in accordance with step d) in claim 19 , wherein new SLT rules are generated from available SLT rules and higher order SLT rules, wherein said higher order SLT rules operate on other SLT rules as data, and wherein said new SLT rule and said SLT rules and higher order SLT rules are formally equivalent and have the same structures, further comprises: a) Receiving an AST based problem and a set of SLT rules, b) Checking each said SLT rule to determine whether the domain and range of said SLT rule matches the data structure AST of said given problem, c) Unless exactly one SLT rule matches, checking each said SLT rule to determine if the range of said SLT rule contains exactly one SLT rule that does match said problem, d) When exactly one SLT rule matches, applying said SLT rule, e) When the output of said SLT rule is a new SLT rule, adding said new SLT rule to said set of SLT rules in step a) and repeating steps b) through e).