fancylojban challenges: Difference between revisions
Spheniscine (talk | contribs) No edit summary |
Spheniscine (talk | contribs) No edit summary |
||
Line 19: | Line 19: | ||
'''return''' gcd(b, a '''mod''' b) | '''return''' gcd(b, a '''mod''' b) | ||
Also try a non-recursive version, but we'd probably need a new brivla for while-loop, and {tu'e...tu'u} in NU | Also try a non-recursive version, but we'd probably need a new brivla for while-loop, and {tu'e...tu'u} in NU. Which brings us to... | ||
== While-loop brivla - English and Lojban definitions == | |||
In the vein of '''ifle''', we might need brivla suitable for describing while-loops... | |||
While-loop: | |||
As long as x1 (du'u proposition) is true, x2 (action/event) repeatedly happens | |||
Do-while-loop | |||
x1 (action/event) happens, then repeats as long as x2 (du'u proposition) is true. | |||
With '''ko''' and '''ko'oi''' turning it into a command that the agent (whether it's a computer or a person) should follow. |
Revision as of 06:01, 21 July 2015
Lojban is supposed to be a logical language, so why not practice translating some common mathematical statements, or algorithms
Additional challenge: Don't use mekso with VUhU. Or use them, if you prefer the challenge of wrangling with mekso grammar...
Fermat's Last Theorem
(The statement, not the proof, of course!)
"No three positive integers a, b, and c can satisfy the equation an + bn = cn for any integer value of n greater than two."
Euclid's Algorithm for Greatest Common Divisor
function gcd(a, b) if b = 0 return a else return gcd(b, a mod b)
Also try a non-recursive version, but we'd probably need a new brivla for while-loop, and {tu'e...tu'u} in NU. Which brings us to...
While-loop brivla - English and Lojban definitions
In the vein of ifle, we might need brivla suitable for describing while-loops...
While-loop: As long as x1 (du'u proposition) is true, x2 (action/event) repeatedly happens
Do-while-loop x1 (action/event) happens, then repeats as long as x2 (du'u proposition) is true.
With ko and ko'oi turning it into a command that the agent (whether it's a computer or a person) should follow.