My creation Love or Not is an augmented reality application that is based on the well-known game, when children try to predict "love or not love" by tearing off the leaves of the shepherd's bag.
In the application, just like in reality (by tapping), we can "tear off" the leaves of the shepherd's bag, and the outcome of the game can be calculated in the same way.
During the design process, I discovered the analogy between the likes and dislikes game and the logic of modern dating sites, especially the most popular Tinder is based on very similar binary user behavior, the
"swipe" to the right or to the left.
I have been interested in the question for quite some time, and it appears in several of my works: Can everything be described with Leibniz's infinitely elegant formula? Even such a complicated phenomenon as love?
Also, even if a "love" or any other program can be written and run an infinite number of times, we cannot be sure whether our efforts make sense.
We find ourselves in the field of questions that arose during the Turing tests: maybe the computer can beat a person in chess, but does it know what chess is?