aboutsummaryrefslogtreecommitdiff
path: root/tempo.md
diff options
context:
space:
mode:
Diffstat (limited to 'tempo.md')
-rw-r--r--tempo.md42
1 files changed, 40 insertions, 2 deletions
diff --git a/tempo.md b/tempo.md
index 87ec277..a29c791 100644
--- a/tempo.md
+++ b/tempo.md
@@ -3,6 +3,18 @@ a temporal, causal-chain based constructed language (conlang) for the structured
## definitions
+let's start by setting some expectations.
+
+***what tempo is***:
+- a conlang
+- a way to formalize thoughts
+- the most efficient way to drain my mental juice
+
+***what tempo is not***:
+- a programming language
+- a proof language
+- a concrete rules system (despite how hard it tries to be)
+
def axiom ``
^^
an axiom is any piece of information that can be denoted in tempo.
@@ -32,7 +44,7 @@ the usage section of an axiom describes how arguments are taken in.
the composite axiom assertion bears a cognitive load: it allows assigning names to the time slice of an axiom. for example: `A = .` returns a random (or non-random) object in the enclosing set of the context.
in our world, this could be an atom, an apple, an idea, a time, a memory, a sound, anything.
-it also serves as a filter, in which `A=. A=.\prop\\me\apple` would filter the first statement, `A=.`, such that A is a property of an apple (since tempo doesn't define apples yet, we contractually import it from our own language as `\me\apple`).
+<!> it also serves as a filter, in which `A=. A=.\prop\\me\apple` would filter the first statement, `A=.`, such that A is a property of an apple (since tempo doesn't define apples yet, we contractually import it from our own language as `\me\apple`).
## fundamental axioms (words)
@@ -118,13 +130,24 @@ def 1 `\me\> + 0`
^^ one:
consequence of zero.
+def 2 `1+1`
+^^ two:
+one and one.
+
+def 3 `2+1`
+^^ three:
+two and one.
+
+every number can be defined this way, you get the idea.
+also, by the way, this is text. hello from text. you'll be seeing more of me later.
+
def < `[x y] y>x + x\neq\y` (A < B)
^^ before:
B > A & A \neq\ B, denotes B comes after A and they are not the same.
def | `[x] A=. A<x A` (| B)
^^ separate:
-the object(s) preceeding the combination of an input object. breaks down an input into its creating parts. using this on an atomic object will return either itself or `0`, depending on the atomic object's lifetime nature.
+the object(s) preceeding the combination of an input object. breaks down an input into its creating parts. using this on a static atomic object will return either itself.
def ! `.*0`
^^
@@ -237,12 +260,27 @@ def \matter\ `A=. A\neq\0 \static\\id\A A\almost\\energy\`
^^ matter:
**universe dependent**. existence which has a persistent identity and is weakly equal to energy.
+def \atom\ `A=. A=\matter\ \epsilon\*A=A (\me\)\prop\A`
+^^ atom:
+an indivisible type of matter which has the property of identity.
+
+def \aH\ `A=. A=\atom\ (\atom\+1)\id\A`
+^^ hydrogen:
+an atom identified by the unity (1).
+
+def \aHe\ `A=. A=\atom\ (\atom\+2)\id\A`
+^^ helium:
+an atom identified by the composite 2.
+
+the rest of the atoms can be defined as such.
+
## update log
// Timestamp: future
- more coming soon.
// Timestamp: 2026-01-01 10:36:31 UTC+3:30
+- happy new year!
- added a smooth css transition for theme changing.
- added a service worker with a serve-cache-then-update strategy. ~~this means you might need two refreshes of the website for new content~~ (the website auto-reloads on new content), but it's worth it.
- added first-paint rendering so that you get the content as fast as possible, without having to wait for a full markdown render.