search

GarryMorrison / Feynman-knowledge-engine

a minimalist but extensible knowledge engine
Other
5 stars 5 forks source link

mathematically verifiable? #23

Open GarryMorrison opened 9 years ago

GarryMorrison commented 9 years ago

The grammar for BKO is simple enough that it might just be mathematically verifiable. That would be cool!

Something interesting to think about down the track. Though I personally couldn't do this. I don't have the maths skills.

Though these pages would help in those efforts: http://write-up.semantic-db.org/49-a-big-collection-of-function-operators.html http://write-up.semantic-db.org/65-new-functions-is-greater-than-is-greater-equal-than-etc.html

I guess my idea would be we prove that individual function operators are correct. Then we would need to prove that BKO composition of correct function operators is also correct.

allthingsgo commented 6 years ago

I wonder if mr. colin james iii could ponder on thus