--- title: "The ZX80/1 As Fortune Cookie" type: "article" slug: "the-zx80-1-as-fortune-cookie" url: "http://localhost/article/the-zx80-1-as-fortune-cookie/" markdown_url: "http://localhost/article/the-zx80-1-as-fortune-cookie.md" published_at: "2020-10-27T17:18:42+00:00" modified_at: "2024-06-23T00:43:28+00:00" featured_image: url: "http://localhost/wp-content/uploads/2022/04/20230809-041332.jpg" excerpt: "In addition to reputed oracular powers, the I Ching has proven to be a source of fascination for mathematicians and computer scientists. This ancient Chinese system of divination comprises one of the earliest known examples of a binary counting scheme." category: - name: "SYNC" slug: "sync" taxonomy: "category" url: "http://localhost/category/periodicals/sync/" post_tag: - name: "1981" slug: "year-1981" taxonomy: "post_tag" url: "http://localhost/tag/year-1981/" - name: "Type-in program" slug: "type-in-program" taxonomy: "post_tag" url: "http://localhost/tag/type-in-program/" - name: "ZX80" slug: "zx80" taxonomy: "post_tag" url: "http://localhost/tag/zx80/" - name: "ZX81" slug: "zx81" taxonomy: "post_tag" url: "http://localhost/tag/zx81/" model: - name: "Sinclair ZX80" slug: "zx80" taxonomy: "model" url: "http://localhost/model/zx80/" - name: "Sinclair ZX81" slug: "zx81" taxonomy: "model" url: "http://localhost/model/zx81/" indiv: - name: "Craig Breighner" slug: "craig-breighner" taxonomy: "indiv" url: "http://localhost/indiv/craig-breighner/" publication: "Sync" publication_r: id: 10243 title: "SYNC" type: "periodical" url: "http://localhost/periodical/sync-magazine/" authors: "Craig Breighner" volume: "1" issue: "5" issues_articles: - id: 26639 title: "SYNC v1 n5" type: "issue" url: "http://localhost/issue/sync-v1-n5/" pages: "39" pubdate: "September/October 1981" archive_link: false volumeissue: "v1n5" --- # The ZX80/1 As Fortune Cookie In addition to reputed oracular powers, the I Ching has proven to be a source of fascination for mathematicians and computer scientists. This ancient Chinese system of divination comprises one of the earliest known examples of a binary counting scheme.