Boo

We stand for love.

© 2024 Boo Enterprises, Inc.

Konstantin

Konstantin

1y

INFJ

Leo

2
1

Conversations for Computer Scientists

Imagine a tree where every branch is a conversation. Every branch in this tree splits into more branches — more conversations. Some branches extend far, leading into more and more conversations — be it deeper and deeper into one. Some branches are connected to lots and lots of branches — many topics to talk about, but none that go deep. I guess am optimal conversation would be a tree that has many branches that extend very far, each branch having lots of branches and each one leading into more. We'll call this optimal tree a fruitful conversation. Fruitful conversations aren't good or bad, they imply that a conversation could be engaging, lots of deep things to talk about. That criteria can cover debates or a great conversation with a partner: lots of things to talk about, and with each one of them we can go on and on. For every person you talk to, you plant a tree. The tree represents your conversation, and it grows in the same manner you converse, navigate through a conversation. It starts out small, from a single branch with which one of you chooses to seed the rest of the tree. The "game" is to find the branches, conversations, that lead to more and more branches: either your conversation leads to more interesting topics to talk about, or your conversation is an interesting topic that can go on and on. Each conversation is interesting or not, and too much uninteresting conversation can starve the tree, just like how if a tree grows into the dark, it can end up dying, which is why it tends to grow towards the sun. Briefly, in computer science terms: a conversation-tree is a C = (V, E), where each vertex is a conversation, a 2-tuple containing a (your response, her response), and each edge is a relation that maps one conversation to many. Each edge has a corresponding 2-tupled weight with each element bring a real numbered value from [-1,1] that represents how the other received the response: (-0.8, 0.8) — they did not like my response in the same intensity that I liked there's. A path is a set of edges, and it's net sum of its weights represents how the conversation has progressed: after a thread of conversations, our net weight is (0.4, 0.2). Looks like we both enjoyed it overall despite some hit or misses on the way. Each agent in the conversation has a real numbered threshold [-1,1], that determines when a conversation will stop. If after a number of conversation your statement received a mediocre, overall reception that's lower than your threshold of what you can take, the next conversation will be a null conversation, a 2-tuple that is empty: ({},{}). If you understand anything up to this point: how would you traverse the tree, so that the net weight of each path is the maximum and uses the least amount of branches. If such an algorithm already exists, what is it's name?

2

11

Comment

Science Community

The science community, chat, and discussion.

JOIN NOW

1.1M SOULS

best
new
Midori

Midori

1y

ENTP

Cancer

7
8

If this is some talk in dating then maybe i do need time off 😂

0

0

Reply

Meet New People

10,000,000+ DOWNLOADS

JOIN NOW