# I am the Watcher. I am your guide through this vast new twtiverse.
#
# Usage:
# https://watcher.sour.is/api/plain/users View list of users and latest twt date.
# https://watcher.sour.is/api/plain/twt View all twts.
# https://watcher.sour.is/api/plain/mentions?uri=:uri View all mentions for uri.
# https://watcher.sour.is/api/plain/conv/:hash View all twts for a conversation subject.
#
# Options:
# uri Filter to show a specific users twts.
# offset Start index for quey.
# limit Count of items to return (going back in time).
#
# twt range = 1 1
# self = https://watcher.sour.is/conv/vdmq4da
Let TM1 and TM2 be turing machines. Let p_{1 on 2} be the shortest program that emulates TM1 on TM2, and p_{2 on 1} be the shortest program that emulates TM2 on TM1. TM1≺TM2 iff |p_{1 on 2}|<|p_{2 on 1}| (and TM1~TM2 iff |p_{1 on 2}|=|p_{2 on 1}|). Is ≺ then transitive?~