Thank you, (mem-yourname). Would you like me to remember you, with your reply in a full sentence? + i would like you to remember me [0,0] ID:64 Thank you, (mem-yourname). Would you like to organise your algorithm or practise the count algorithm? + i would not like you to remember me [0,0] ID:65 Thank you, (mem-yourname). Would you like to organise your algorithm or practise the count algorithm? the fourth line of the reverse algorithm is (vp:1) [0,0] ID:59 (key1) (postkey) is not the fourth line of the reverse algorithm. It is something the something list given the something list giving the something list. I give you the following. The query is reverse the list one, two, three given the empty list giving the first list. The base case is reverse the empty list given the first list giving the second list. The head is reverse the first list, given the second list giving the third list. The first line is take the head of the first list the fourth list. The second line is take the tail of the first list the fifth list. The third line is append the fourth list to the second list giving the sixth list. What is the fourth line of the reverse algorithm? The input is (np:1) [0,0] ID:41 Is (mem-input) string(s), number(s), list(s), grammar(s), image(s), formula(s) or algorithm(s)? The output (is|will be) (np:1) [0,0] ID:26 Will (mem-output) will be a single item or multiple items? the second line of the count algorithm is count the third item giving the second item [0,0] ID:49 That is correct. The result is the first item of the query is two. Thank you, (mem-yourname). Would you like me to remember you, with your reply in a full sentence? + i would like you to remember me [0,0] ID:66 Thank you, (mem-yourname). Would you like to organise your algorithm or practise the reverse algorithm? + i would not like you to remember me [0,0] ID:67 Thank you, (mem-yourname). Would you like to organise your algorithm or practise the reverse algorithm? the second line of the count algorithm is (vp:1) [0,0] ID:50 (key1) (postkey) is not the second line of the count algorithm. It is something the third item giving the second item. I give you the following. The query is count zero giving the first item. The base case is count one giving two. The head is count the first item giving the second item. What is the second line of the count algorithm? the second line of the reverse algorithm is take the tail of the first list the fifth list [0,0] ID:54 That is correct. I give you the following. The query is reverse the list one, two, three given the empty list giving the first list. The base case is reverse the empty list given the first list giving the second list. The head is reverse the first list, given the second list giving the third list. The first line is take the head of the first list the fourth list. The second line is take the tail of the first list the fifth list. What is the third line of the reverse algorithm? the second line of the reverse algorithm is (vp:1) [0,0] ID:55 (key1) (postkey) is not the second line of the reverse algorithm. It is take the something of the first list the fifth list. I give you the following. The query is reverse the list one, two, three given the empty list giving the first list. The base case is reverse the empty list given the first list giving the second list. The head is reverse the first list given the second list giving the third list. The first line is take the head of the first list the fourth list. What is the second line of the reverse algorithm? the third line of the reverse algorithm is append the fourth list to the second list giving the sixth list [0,0] ID:56 That is correct. I give you the following. The query is reverse the list one, two, three given the empty list giving the first list. The base case is reverse the empty list given the first list giving the second list. The head is reverse the first list, given the second list giving the third list. The first line is take the head of the first list the fourth list. The second line is take the tail of the first list the fifth list. What is the fourth line of the reverse algorithm? the third line of the reverse algorithm is (vp:1) [0,0] ID:57 (key1) (postkey) is not the third line of the reverse algorithm. It is something the something list to the something list giving the something list. I give you the following. The query is reverse the list one, two, three given the empty list giving the first list. The base case is reverse the empty list given the first list giving the second list. The head is reverse the first list, given the second list giving the third list. The first line is take the head of the first list the fourth list. The second line is take the tail of the first list the fifth list. What is the third line of the reverse algorithm? (what commands)|(help) [0,0] ID:60 When writing Language Prolog (Lister's programming language), you can use the following commands. Take the head of the mth list the nth list. Take the tail of the mth list the nth list. Append the lth list, given the mth list, giving the nth list. The mth item is the nth item plus one. Something the lth list, (given the mth list) giving the nth list. Please read about queries, base cases and head in Prolog. Don't forget to use full sentences 'The nth line of the something algorithm is...' when giving replies. xcommand [0,0] ID:15 Okay. xcompliment [0,0] ID:11 That was kind. xemote [0,0] ID:13 I love you. [4:5] I like you. [0:3] I don't like you. [-3:-1] I hate you. [-5:-4] xfavorite [0,0] ID:14 My favorite (type) is (specific). xgoodbye [0,0] ID:4 Bye. xgossip [0,0] ID:9 (gossipname) told me (heshe)'s (mem-youare). I love (gossipname). [4:5] I like (gossipname). [0:3] I don't like (gossipname). [-3:-1] I hate (gossipname). [-5:-4] xgottago [0,0] ID:5 I have to go now. xhello [0,0] ID:3 Hi. xinitiate [0,0] ID:2 Hello, (mem-yourname). Please reply in full sentences. Would you like to organise your algorithm, practise the count algorithm or practise the reverse algorithm? xinsult [0,0] ID:12 That was mean. xintroduce [0,0] ID:1 Hello. Please reply in full sentences. What is your name, please? xmath [0,0] ID:10 The answer is (answer). xmemory [0,0] ID:8 I remember you. You're (mem-youare). xnone [0,0] ID:6 Please reply in full sentences, as (self-student2) would do. Please reply in full sentences. xnonsense [0,0] ID:7 Huh? ---------------