Lister * August 10 2019
155071.191445.61 [userID,makerID,Responses]
 
AIScript: 
 
Language Center
---------------
i am, my name is [0,1] ID:25 <?PF remember (postkey) as only "yourname" ?>
	Hello, (mem-yourname). Would you like to organise your algorithm, practise the count algorithm or practise the reverse algorithm?
I have organised my algorithm zebulontheta [0,0] ID:61
	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:62 <?PF self: remember (mem-yourname) as "student2" ?>
		Thank you, (mem-yourname). Would you like to practise the count algorithm or practise the reverse algorithm?
		+ i would not like you to remember me [0,0] ID:63
		Thank you, (mem-yourname). Would you like to practise the count algorithm or practise the reverse algorithm?
i would like to organise my algorithm [0,0] ID:45 <?PF remember "organise my algorithm" as only "sessionaim" ?>
	Assuming you know the input(s), output(s) and their data types, please tell me what the output is?
i would like to practise the count algorithm [0,0] ID:46 <?PF remember "practise the count algorithm" as only "sessionaim" ?>
	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 first line of the count algorithm?
i would like to practise the reverse algorithm [0,0] ID:51 <?PF remember "practise the reverse algorithm" as only "sessionaim" ?>
	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. What is the first line of the reverse algorithm?
(mem-input) (is|will be) (a|) formula+s [0,0] ID:39 <?PF remember "formula" as only "inputtype" ?>
	goto 61
(mem-input) (is|will be) (a|) grammar+s [0,0] ID:37 <?PF remember "grammar" as only "inputtype" ?>
	goto 61
(mem-input) (is|will be) (a|) list+s [0,0] ID:36 <?PF remember "list" as only "inputtype" ?>
	goto 61
(mem-input) (is|will be) (a|) number+s [0,0] ID:35 <?PF remember "number" as only "inputtype" ?>
	goto 61
(mem-input) (is|will be) (a|) string+s [0,0] ID:34 <?PF remember "string" as only "inputtype" ?>
	goto 61
(mem-input) (is|will be) (an|) algorithm+s [0,0] ID:40 <?PF remember "algorithm" as only "inputtype" ?>
	goto 61
(mem-input) (is|will be) (an|) image+s [0,0] ID:38 <?PF remember "image" as only "inputtype" ?>
	goto 61
(mem-output) (is|will be) (a|) algorithm+s [0,0] ID:33 <?PF remember "algorithm" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) (a|) formula+s [0,0] ID:32 <?PF remember "formula" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) (a|) grammar+s [0,0] ID:30 <?PF remember "grammar" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) (a|) list+s [0,0] ID:29 <?PF remember "list" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) (a|) number+s [0,0] ID:28 <?PF remember "number" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) a single item [100,1] ID:22 <?PF remember "a single item" as only "outputformat" ?>
	Is (mem-output) string(s), number(s), list(s), grammar(s), image(s), formula(s) or algorithm(s)?
(mem-output) (is|will be) (a|) string+s [0,0] ID:24 <?PF remember "string" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) (an|) image+s [0,0] ID:31 <?PF remember "image" as only "outputtype" ?>
	What is the input, please?
(mem-output) (is|will be) multiple items [0,0] ID:27 <?PF remember "all required items" as only "outputformat" ?>
	Will (mem-output) be returned as one item or one at a time?
(mem-output) will be returned as one item [0,0] ID:23 <?PF remember "one item" as only "outputnumber" ?>
	Is (mem-output) string(s), number(s), list(s), grammar(s), image(s), formula(s) or algorithm(s)?
(mem-output) will be returned one at a time [0,0] ID:42 <?PF remember "one at a time" as only "outputnumber" ?>
	Is (mem-output) string(s), number(s), list(s), grammar(s), image(s), formula(s) or algorithm(s)?
the first line of the count algorithm is (np:1) [0,0] ID:48
	The first line of the count algorithm is not (key1) (postkey), it is the third item is something. 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 first line of the count algorithm?
the first line of the count algorithm is the third item is the first item plus one [0,0] ID:47 <?PF remember "the third item is the first item plus one" as only "countalgorithmfirstline" ?>
	That is correct. 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 first line of the reverse algorithm is take the head of the first list the fourth list [0,0] ID:52 <?PF remember "take the head of the first list the fourth list" as only "reversealgorithmfirstline" ?>
	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. What is the second line of the reverse algorithm?
the first line of the reverse algorithm is (vp:1) [0,0] ID:53
	(key1) (postkey) is not the first line of the reverse algorithm. It is take the something of the first list the fourth 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. What is the first line of the reverse algorithm?
the fourth line of the reverse algorithm is reverse the fifth list given the sixth list giving the third list [0,0] ID:58 <?PF remember "reverse the fifth list given the sixth list giving the third list" as only "reversealgorithmfourthline" ?>
	That is correct. The result is the first list of the query is three, two, one. <br>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 <?PF self: remember (mem-yourname) as "student2" ?>
		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 <?PF remember (key1) as only "input" ?>
	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 <?PF remember (key1) as only "output" ?>
	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 <?PF remember "count the third item giving the second item" as only "countalgorithmsecondline" ?>
	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 <?PF self: remember (mem-yourname) as "student2" ?>
		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 <?PF remember "take the tail of the first list the fifth list" as only "reversealgorithmsecondline" ?>
	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 <?PF remember "append the fourth list to the second list giving the sixth list" as only "reversealgorithmthirdline" ?>
	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 <?PF remember "help" as only "help" ?>
	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?
---------------