explain - (explanation pending).

A game of exploring space(s). Language spaces. It is a game of 4 words and 2 BOPs[3]. You can swch the bits in E and I, which can take the normal values of 0 and 1, but also the values of / and 1/0. The mystery continues in that you have to find paths, with words, that verify IN ALL CASES (IAC), but, it's up to you to verify that, probabilisically, your answer is correct. That's because your only input is a RANDOM VALUE (RV), or a bit that can either be 1 or 0. This is through the use of the first word, 'tri', as follows:

    $ explain 1/0 / tri

This is the first word. tri will take the contents of the E LOCATION and give it a random value of 1 or 0 if it's contents were intially /, aka 1/0. The intial contents are always / at the start of every run, so you always get a fresh start with every sentence.

From there you will prove sentances. The words are evaluated to produce the result of the compuatation on the 'Seed' processor as you write 'expect'ations, or test cases. I mean, there's only 2 bits, it can't be that hard to figure them all out, right? It's up to you to see how long a string of words you can make, and also, how little debugging output you can have, and if you get a 'pass' at the end. That's the competition. The longest amount of words with the least output. Hopefully, the sentences might even do something useful (someday).

This is really a game about metaprogramming. You will not, for long, want to program in the base #Logica itself. You will want to design a META PROGRAMMING (MP) system, one which will GENERATE YOUR CODE (GYC) for you. This because, with so few words (although it's Turing Complete[2]), writing it by itself, I think, will get boring quite quickly.

I have defined the command 'meta', a higher level word, one which feeds data into 'explain':

    meta is the next word after tri, swch and not
    
    SYNTAX: meta <word> <explanation ...>
    
      meta is 'meta'.
    
      <word> is a string of characters surrounded by white space.
      
      <explaination> is a string of words.
      
   SUMMARY:
      
      meta will define a word as an explanation.
      
      when meta encounters a word with an explanation, it replaces
      that word with the explanation.
      
      that's it.
   
   FILES:
   
       meta reads a Metafile from the current directory upon invocation.
       
       The syntax of this file is simply meta defintions, without the 
       word meta at the start:
       
           worda tri not swap
           wordb tri not mov
      
   EXAMPLES:
      
      $ meta newword tri not swap   
      
   BUGS:
   
      I hope not.
      
   AUTHOR:
  
      TMD Inc.

See 'expect', in the top level of the repsitory. Check it's history for more explanation.

This program runs best on macOS or Solaris[1].

PROBLEMS

1. With only tri (aka skipwhen), not, swap and mov there's no way to define a constant in #Logica, given the rules and its inital startup state of / /. How do you get a 0 bit in E?

2. How would you define π in #Logica? As a constant, or a computed value? Which do you think would produce a shorter program? Would there even be a difference between a 'constant' or 'computed' value on this machine? What is the difference?

-- Burton Samograd root@busfactor1.ca http://busfactor1.ca/

2017

[1] Real UNIX based operating systems. The ones with Korn Shell by deafult.

[2] Citation Needed.

[3] A BOP is a like a BIT, but with 3 states: 0, 1 and /. / Represents the 'unknown' state. There is also a 4th state, one which is given to as a parameter to 'expect', of 1/0. This means you expect the result in the specified LOCATION (E or I) to be EITHER 1 OR 0 (E1O0) at the end of the TEST.

References

MetaMaths! - Gregory Chaitin

Exploring Randomness - Gregory Chaitin

The Limits of Mathematics - Gregory Chaitin

The Unknowable - Gregory Chaitin

Proving Darwin - Gregory Chaitin

Principia Mathematica - Russel and Whitehead

Algorithms - various

-- This document is written in Clarity, but may contain bugs. WIP