From ab7a1bf5647931e93d76a4cfcbb81bff95301d29 Mon Sep 17 00:00:00 2001 From: Christian Carter Date: Sat, 28 Sep 2013 13:52:13 -0700 Subject: [PATCH] removing old Nock specs --- Spec/nock/10.txt | 70 -------------------------------------------- Spec/nock/11.txt | 74 ----------------------------------------------- Spec/nock/12.txt | 75 ------------------------------------------------ Spec/nock/13.txt | 71 --------------------------------------------- Spec/nock/6.txt | 42 --------------------------- Spec/nock/7.txt | 42 --------------------------- Spec/nock/8.txt | 45 ----------------------------- Spec/nock/9.txt | 43 --------------------------- 8 files changed, 462 deletions(-) delete mode 100644 Spec/nock/10.txt delete mode 100644 Spec/nock/11.txt delete mode 100644 Spec/nock/12.txt delete mode 100644 Spec/nock/13.txt delete mode 100644 Spec/nock/6.txt delete mode 100644 Spec/nock/7.txt delete mode 100644 Spec/nock/8.txt delete mode 100644 Spec/nock/9.txt diff --git a/Spec/nock/10.txt b/Spec/nock/10.txt deleted file mode 100644 index 27d1e8c730..0000000000 --- a/Spec/nock/10.txt +++ /dev/null @@ -1,70 +0,0 @@ -Author: Mencius Moldbug [moldbug@gmail.com] -Date: 9/15/2008 -Version: 10K - -1. Introduction - - This file defines one function, "nock." - - nock is in the public domain. - -2. Data - - A "noun" is either an "atom" or a "cell." An "atom" is an unsigned - integer of any size. A "cell" is an ordered pair of any two nouns, - the "head" and "tail." - -3. Semantics - - nock maps one noun to another. It doesn't always terminate. - -4. Pseudocode - - nock is defined in a pattern-matching pseudocode, below. - - Brackets enclose cells. [a b c] is [a [b c]]. - -5. Definition - -5.1 Transformations - - *[a [b c] d] => [*[a b c] *[a d]] - *[a 0 b] => /[b a] - *[a 1 b] => [b] - *[a 2 b c d] => *[a 3 [0 1] 3 [1 c d] [1 0] 3 [1 2 3] [1 0] 5 5 b] - *[a 3 b] => **[a b] - *[a 4 b] => &*[a b] - *[a 5 b] => ^*[a b] - *[a 6 b] => =*[a b] - *[a] => *[a] - -5.2 Operators - -5.2.1 Goto [*] - - *[a] -> nock[a] - -5.2.2 Deep [&] - - &[a b] -> 0 - &[a] -> 1 - -5.2.4 Bump [^] - - ^[a b] -> ^[a b] - ^[a] -> (a + 1) - -5.2.5 Like [=] - - =[a a] -> 0 - =[a b] -> 1 - =[a] -> =[a] - -5.2.6 Snip [/] - - /[1 a] -> a - /[2 a b] -> a - /[3 a b] -> b - /[(a + a) b] -> /[2 /[a b]] - /[(a + a + 1) b] -> /[3 /[a b]] - /[a] -> /[a] diff --git a/Spec/nock/11.txt b/Spec/nock/11.txt deleted file mode 100644 index da9dafb91b..0000000000 --- a/Spec/nock/11.txt +++ /dev/null @@ -1,74 +0,0 @@ -Author: Mencius Moldbug (moldbug@gmail.com) -Date: 5/25/2008 -Version: 11K - -1. Introduction - - This file defines one function, "nock." - - nock is in the public domain. - -2. Data - - A "noun" is either an "atom" or a "cell." An "atom" is an unsigned - integer of any size. A "cell" is an ordered pair of any two nouns, - the "head" and "tail." - -3. Semantics - - nock maps one noun to another. It doesn't always terminate. - -4. Pseudocode - - nock is defined in a pattern-matching pseudocode, below. - - Parentheses enclose cells. (a b c) is (a (b c)). - -5. Definition - -5.1 Transformations - - *(a (b c) d) => (*(a b c) *(a d)) - *(a 0 b) => /(b a) - *(a 1 b) => (b) - *(a 2 b c d) => *(a 3 (0 1) 3 (1 c d) (1 0) 3 (1 2 3) (1 0) 5 5 b) - *(a 3 b) => **(a b) - *(a 4 b) => &*(a b) - *(a 5 b) => ^*(a b) - *(a 6 b) => =*(a b) - - *(a 7 b c) => *(a 3 (((1 0) b) c) 1 0 3) - *(a 8 b c) => *(a c) - - *(a) => *(a) - -5.2 Operators - -5.2.1 Goto (*) - - *(a) -> nock(a) - -5.2.2 Deep (&) - - &(a b) -> 0 - &(a) -> 1 - -5.2.4 Bump (^) - - ^(a b) -> ^(a b) - ^(a) -> a + 1 - -5.2.5 Same (=) - - =(a a) -> 0 - =(a b) -> 1 - =(a) -> =(a) - -5.2.6 Snip (/) - - /(1 a) -> a - /(2 a b) -> a - /(3 a b) -> b - /((a + a) b) -> /(2 /(a b)) - /((a + a + 1) b) -> /(3 /(a b)) - /(a) -> /(a) diff --git a/Spec/nock/12.txt b/Spec/nock/12.txt deleted file mode 100644 index d3762e8557..0000000000 --- a/Spec/nock/12.txt +++ /dev/null @@ -1,75 +0,0 @@ -Author: Curtis Yarvin (curtis.yarvin@gmail.com) -Date: 3/28/2008 -Version: 0.12 - -1. Introduction - - This file defines one function, "nock." - - nock is in the public domain. - -2. Data - - A "noun" is either an "atom" or a "cell." An "atom" is an unsigned - integer of any size. A "cell" is an ordered pair of any two nouns, - the "head" and "tail." - -3. Semantics - - nock maps one noun to another. It doesn't always terminate. - -4. Pseudocode - - nock is defined in a pattern-matching pseudocode, below. - - Parentheses enclose cells. (a b c) is (a (b c)). - -5. Definition - -5.1 Transformations - - *(a (b c) d) => (*(a b c) *(a d)) - *(a 0 b) => /(b a) - *(a 1 b) => (b) - *(a 2 b c) => *(*(a b) c) - *(a 3 b) => **(a b) - *(a 4 b) => &*(a b) - *(a 5 b) => ^*(a b) - *(a 6 b) => =*(a b) - - *(a 7 b c d) => *(a 3 (0 1) 3 (1 c d) (1 0) 3 (1 2 3) (1 0) 5 5 b) - *(a 8 b c) => *(a 2 (((1 0) b) c) 0 3) - *(a 9 b c) => *(a c) - - *(a) => *(a) - -5.2 Operators - -5.2.1 Goto (*) - - *(a) -> nock(a) - -5.2.2 Deep (&) - - &(a b) -> 0 - &(a) -> 1 - -5.2.4 Bump (^) - - ^(a b) -> ^(a b) - ^(a) -> a + 1 - -5.2.5 Same (=) - - =(a a) -> 0 - =(a b) -> 1 - =(a) -> =(a) - -5.2.6 Snip (/) - - /(1 a) -> a - /(2 a b) -> a - /(3 a b) -> b - /((a + a) b) -> /(2 /(a b)) - /((a + a + 1) b) -> /(3 /(a b)) - /(a) -> /(a) diff --git a/Spec/nock/13.txt b/Spec/nock/13.txt deleted file mode 100644 index 2295e5ead5..0000000000 --- a/Spec/nock/13.txt +++ /dev/null @@ -1,71 +0,0 @@ -Author: Curtis Yarvin (curtis.yarvin@gmail.com) -Date: 3/8/2008 -Version: 0.13 - -1. Manifest - - This file defines one Turing-complete function, "nock." - - nock is in the public domain. So far as I know, it is - neither patentable nor patented. Use it at your own risk. - -2. Data - - Both the domain and range of nock are "nouns." - - A "noun" is either an "atom" or a "cell." An "atom" is an unsigned - integer of any size. A "cell" is an ordered pair of any two nouns, - the "head" and "tail." - -3. Pseudocode - - nock is defined in a pattern-matching pseudocode. - - Match precedence is top-down. Operators are prefix. Parens - denote cells, and group right: (a b c) is (a (b c)). - -4. Definition - -4.1 Transformations - - *(a 0 b c) => *(*(a b) c) - *(a 0 b) => /(b a) - *(a 1 b) => (b) - *(a 2 b) => **(a b) - *(a 3 b) => &*(a b) - *(a 4 b) => ^*(a b) - *(a 5 b) => =*(a b) - *(a 6 b c d) => *(a 2 (0 1) 2 (1 c d) (1 0) 2 (1 2 3) (1 0) 4 4 b) - *(a b c) => (*(a b) *(a c)) - *(a) => *(a) - -4.2 Operators - -4.2.1 Goto (*) - - *(a) -> nock(a) - -4.2.2 Deep (&) - - &(a b) -> 0 - &(a) -> 1 - -4.2.3 Bump (^) - - ^(a b) -> ^(a b) - ^(a) -> a + 1 - -4.2.4 Same (=) - - =(a a) -> 0 - =(a b) -> 1 - =(a) -> =(a) - -4.2.5 Snip (/) - - /(1 a) -> a - /(2 a b) -> a - /(3 a b) -> b - /((a + a) b) -> /(2 /(a b)) - /((a + a + 1) b) -> /(3 /(a b)) - /(a) -> /(a) diff --git a/Spec/nock/6.txt b/Spec/nock/6.txt deleted file mode 100644 index 1dbd599583..0000000000 --- a/Spec/nock/6.txt +++ /dev/null @@ -1,42 +0,0 @@ -1 Structures - - A noun is an atom or a cell. An atom is any natural number. - A cell is an ordered pair of nouns. - -2 Reductions - - nock(a) *a - [a b c] [a [b c]] - - ?[a b] 0 - ?a 1 - +a 1 + a - =[a a] 0 - =[a b] 1 - - /[1 a] a - /[2 a b] a - /[3 a b] b - /[(a + a) b] /[2 /[a b]] - /[(a + a + 1) b] /[3 /[a b]] - - *[a [b c] d] [*[a b c] *[a d]] - - *[a 0 b] /[b a] - *[a 1 b] b - *[a 2 b c] *[*[a b] *[a c]] - *[a 3 b] ?*[a b] - *[a 4 b] +*[a b] - *[a 5 b] =*[a b] - - *[a 6 b c d] *[a 2 [0 1] 2 [1 c d] [1 0] 2 [1 2 3] [1 0] 4 4 b] - *[a 7 b c] *[a 2 b 1 c] - *[a 8 b c] *[a 7 [[0 1] b] c] - *[a 9 b c] *[a 7 c 0 b] - *[a 10 b c] *[a c] - *[a 10 [b c] d] *[a 8 c 7 [0 2] d] - - +[a b] +[a b] - =a =a - /a /a - *a *a diff --git a/Spec/nock/7.txt b/Spec/nock/7.txt deleted file mode 100644 index bd3e295083..0000000000 --- a/Spec/nock/7.txt +++ /dev/null @@ -1,42 +0,0 @@ -1 Structures - - A noun is an atom or a cell. An atom is any natural number. - A cell is any ordered pair of nouns. - -2 Pseudocode - - [a b c] [a [b c]] - nock(a) *a - - ?[a b] 0 - ?a 1 - ^a 1 + a - =[a a] 0 - =[a b] 1 - - /[1 a] a - /[2 a b] a - /[3 a b] b - /[(a + a) b] /[2 /[a b]] - /[(a + a + 1) b] /[3 /[a b]] - - *[a [b c] d] [*[a b c] *[a d]] - - *[a 0 b] /[b a] - *[a 1 b] b - *[a 2 b c] *[*[a b] *[a c]] - *[a 3 b] ?*[a b] - *[a 4 b] ^*[a b] - *[a 5 b] =*[a b] - - *[a 6 b c d] *[a 2 [0 1] 2 [1 c d] [1 0] 2 [1 2 3] [1 0] 4 4 b] - *[a 7 b c] *[a 2 b 1 c] - *[a 8 b c] *[a 7 [[7 [0 1] b] 0 1] c] - *[a 9 b c] *[a 7 c 0 b] - *[a 10 b c] *[a c] - *[a 10 [b c] d] *[a 8 c 7 [0 3] d] - - ^[a b] ^[a b] - =a =a - /a /a - *a *a diff --git a/Spec/nock/8.txt b/Spec/nock/8.txt deleted file mode 100644 index 2981d6c5f7..0000000000 --- a/Spec/nock/8.txt +++ /dev/null @@ -1,45 +0,0 @@ -1 Structures - - A noun is an atom or a cell. An atom is any unsigned integer. - A cell is an ordered pair of nouns. - -2 Pseudocode - - [a b c] is [a [b c]]; *a is nock(a). Reductions match top-down. - -3 Reductions - - ?[a b] 0 - ?a 1 - ^a (a + 1) - =[a a] 0 - =[a b] 1 - - /[1 a] a - /[2 a b] a - /[3 a b] b - /[(a + a) b] /[2 /[a b]] - /[(a + a + 1) b] /[3 /[a b]] - - *[a [b c] d] [*[a b c] *[a d]] - *[a 0 b] /[b a] - *[a 1 b] b - *[a 2 b c] *[*[a b] *[a c]] - *[a 3 b] ?*[a b] - *[a 4 b] ^*[a b] - *[a 5 b] =*[a b] - - *[a 6 b c d] *[a 2 [0 1] 2 [1 c d] [1 0] 2 [1 2 3] [1 0] 4 4 b] - *[a 7 b c] *[a 2 b 1 c] - *[a 8 b c] *[a 7 [7 b [0 1]] c] - *[a 9 b c] *[a 8 b 2 [[7 [0 3] d] [0 5]] 0 5] - *[a 10 b c] *[a 8 b 8 [7 [0 3] c] 0 2] - *[a 11 b c] *[a 8 b 7 [0 3] c] - *[a 12 b c] *[a [1 0] 1 c] - - ^[a b] ^[a b] - =a =a - /a /a - *a *a - - diff --git a/Spec/nock/9.txt b/Spec/nock/9.txt deleted file mode 100644 index b6aabad768..0000000000 --- a/Spec/nock/9.txt +++ /dev/null @@ -1,43 +0,0 @@ -1 Context - - This spec defines one function, Nock. - -2 Structures - - A noun is an atom or a cell. An atom is any unsigned integer. - A cell is an ordered pair of any two nouns. - -3 Pseudocode - - Brackets enclose cells. [a b c] is [a [b c]]. - - *a is Nock(a). Reductions match top-down. - -4 Reductions - - ?[a b] => 0 - ?a => 1 - - ^[a b] => ^[a b] - ^a => (a + 1) - - =[a a] => 0 - =[a b] => 1 - =a => =a - - /[1 a] => a - /[2 a b] => a - /[3 a b] => b - /[(a + a) b] => /[2 /[a b]] - /[(a + a + 1) b] => /[3 /[a b]] - /a => /a - - *[a 0 b] => /[b a] - *[a 1 b] => b - *[a 2 b c d] => *[a 3 [0 1] 3 [1 c d] [1 0] 3 [1 2 3] [1 0] 5 5 b] - *[a 3 b] => **[a b] - *[a 4 b] => ?*[a b] - *[a 5 b] => ^*[a b] - *[a 6 b] => =*[a b] - *[a [b c] d] => [*[a b c] *[a d]] - *a => *a