The Salty Schemer

A simple introduction to topological quantum computation Part 1

2011-08-20T22:12:00.001-07:00

Introduction and Big Pictures Ever wonder about why knot theory is related to quantum theory? Ever wonder why your shoes tie the way they do but they still become undone? Ever wonder why you don't have a significant other? Well we will try to answer the first two questions but the third is beyond the scope of this post. (The third is beyond the scope of the author at times....) Remember that

Rethinking Geometric Complexity Theory

2011-08-03T04:34:00.001-07:00

Recently there has been a great deal of literature on category theory and computational complexity. On the other hand I am currently unsatisfied with geometric complexity theory and I think knot theory can be used to counteract this. I believe it can be reformulated into a more topological version that could cut down on the amount of computations. See http://arxiv.org/abs/0908.1936 Therefore

Roadmap on what to do next

2011-07-18T10:09:00.001-07:00

---------- Forwarded message ----------From: "Cezary Bartosiak" Date: Jul 18, 2011 11:54 AMSubject: Re: Roadmap on what to do next To: "Joshua Herman" Cc: "Tanya Berger-Wolf" Hi,These things should be done before you can rewrite:* change DynamicStatistics interface to extend Statistics and remove DynamicStatisticsImpl *

Haven: An open source cloud engine.

2010-03-09T11:11:00.001-08:00

This project Idea is more like a combination of plan9 and RenrakuOS with elements from singularitybut done correctly and much more open development. I plan on having all running code as managed code all in a virtual machine. The virtual machine will boot up across a group of diskless / nondiskless nodes. There will be no file system but more like central database that all nodes can access and

Chicago-01 Project

2010-03-04T22:36:00.001-08:00

This project Idea is similar to http://github.com/daeken/RenrakuOS but with a more network aware setup. I plan on having all managed code all in a virtual machine. The virtual machine will boot up across a group of diskless / nondiskless nodes. There will be no file system but more like central database that all nodes can access and write to. I plan on having a nanokernel on the diskless nodes

Graph field automata (WORK IN PROGRESS)

2010-02-21T22:38:00.001-08:00

Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars \cite{Pedro} are an algebratization of graph rewriting systems. Here we present the dual of this formalism which some extensions which we term Graph Field Automata The advantage to this approach is a framework for expressing machines that can use Matrix Graph Grammars. http://

2010-02-05T04:56:00.001-08:00

Quantum computation and Knot theoryLately I have been studying quantum computation and its interrelation with knot theory with Louis Kaufman . I have looked at software packages but there doesn't seem anything specifically for topological quantum computation. The main interrelation that I have been studing is the yang baxter equation and how that can be used as a braid operator. Specifically

2008-12-18T17:20:00.000-08:00

Abstract Graph Machines http://arxiv.org/abs/0812.4009Abstract:This paper describes a new automata which is Turing Complete. These algorithms use a data structure which can be described as an abstract graph representation. The construction of this machine can be desribed as a matrix machine performing operations on the data set. This outlines both a deterministic and nondeterministic operation of

2008-09-26T22:16:00.000-07:00

LeftParen This seems to be an interesting new framework which uses some libraries from PLaneT. According to the websiteFeaturesAutomatic creation of the basic directory structure of your projectA "Hello, World" with zero lines of codeSimple data persistance storage through the "record" abstractionNo databases or schemasSession and cookie supportUser accounts and authentication out-of-the-boxEasy

2008-01-23T21:13:00.000-08:00

Mashing up Here is something that I did in yahoo pipes. It shows how that using a query from the user you can search multiple websites. It accomplishes this by sending a query to a few torrent search engines (mininova, isohunt, btjunkie, sumotorrent). This is accomplished by the URL builder module for each website. Then it fetches the RSS feed from all of those websites and puts them into a

Book of Poems Up On Lulu

2007-12-10T18:03:00.001-08:00

My poetry book Dabru Emet is online at lulu. I used LaTeX to typeset the inside. Also, Emacs + AucTeX was my development environment It is available in digital and dead tree formats. From the textThe schemeFor when I found the holy lispSo pure the curves that are parensWith a report merely one short textOf beauty's simplictyI knew that lisp was for meBut then there was a choiceOf thousand page

2007-07-07T14:13:00.000-07:00

Register To Vote for R6RS and R5.97RS.Currently there is a vote for the ratification of R6RS. To vote you have to register with the draft committee. This involves giving your information and a short paragraph on your interest in R6RS. Also the final draft of R6RS is out.

2007-05-26T22:17:00.001-07:00

Working Through SICPCurrently I am reading SICP. It is a great book as an introduction to computer science and programming with scheme. Right now I am about on the second chapter and have completed most of the exercises. It is really lots of fun doing the exercises and eventually getting the exercises done right.

2006-09-25T18:08:00.000-07:00

The Little Schemer Book Review This book is an introduction to thinking about computation and consequently the scheme programming language. The only prerequisites needed for the book is arithmetic. It is written in a series of dialogues and has humor interspersed. Also it introduces the idea of recursion in lisp and this ends with the y combinator being fully introduced in scheme. The book

2006-09-14T20:11:00.000-07:00

R6RS preliminary report !There is a preliminary report on R6RS.org in PDF format at R6RS PDF. It is a draft version and is currently incomplete but it reflects what the committee has decided so far. There is a public review process which allows you to suggest features or other changes available on the main page.

2006-09-07T15:26:00.000-07:00

Continuing Work I have updated the page with a new abstract or synopsis of the page. From Beyond lisp CSW page AbstractThe purpose of this language is to encode a logical framework to reason about data. The problem we are trying to solve is the limitations of current logical programming languages being restricted to a limited area of logic. Another problem we are trying to solve is the ability

2006-08-29T21:14:00.000-07:00

Multisets and structure I am now trying to revise the structure of the wiki page and make it a much more formal document. Flow structure has been improved and I have added multisets / bags as a feature of the language. From the document itself.These are lsets with the added feature of multiplicity. This means that an element in an multiset can occur more than once but when you bons (bag cons)

2006-08-28T20:24:00.000-07:00

Starting an implementation / new features If you check the blog page I have added many new features and started to implement some of the features. So far I have implemented part of the set theory features. rel? and fun? predicates allow for the definition of finite functions. At this time the operations assume a finite set of values. Also I have started to specify the language in EBNF. For those

2006-08-24T18:03:00.000-07:00

To Boldly Go Where No Lisp Has Gone Before (Update on Beyond Lisp) At this current time I am working the language out on paper before implementation. Here are the things that I wish to have in the language. Other than being a typical lisp-1 modeled as extensions to lisp. I have greatly revised and added more content such as the logical equality of sets, some commonly used sets for manipulation,

2006-08-21T13:54:00.000-07:00

Beyond Lisp I have started to rethink lisp from the bottom up for the past year. Lists are still important part of the language John McCarthy believes in attempting to rethink lisp's core into a new thing. I have been thinking about this idea for awhile and have recently had a deeper insight into not just processing lists. Instead we replace lists with a important abstraction in mathematics.

2006-08-20T19:11:00.000-07:00

The Game of Love Update Here is the abstract of the paper for people who want to get an idea of what the recently posted paper was all about. I am currently rewriting it and adding new content to make it more mathematically rigorous. This relates to my earlier postings about zobirst hashing and surreal numbers because I wish to create a dating simulation that attempts to approximate real

2006-08-15T08:05:00.000-07:00

A mathematical Theory Of Love I am currently working on a mathematical theory of love using combinatorial game theory for the purpose of biological simulation. At this time I think I can request comments from others. That document is copyright 2006 By Joshua Herman. Mathematical Theory of Love

2006-08-07T16:45:00.000-07:00

Collatz Collector Program and M91 Program I haven't posted in awhile so here is some from my code archive that I have written.CollatzProblem and the McCarthy91-Function.(define (collatz n) (and (display n)) (cond ((and (odd? n) (> n 1)) (collatz (+ 1 (* 3 n)))) ((even? n) (collatz (/ n 2)))))(define (optimized-collatz n) (begin (and (display n))

2006-07-22T13:31:00.000-07:00

Current Surreal-numbers code ;;; -*- mode: scheme surreal-numbers -*-;;;; Surreal Numbers Datatype;;; This code is written by Joshua Herman and placed in the Public;;; Domain. All warranties are disclaimed.;;; For more information about surreal numbers see;;; http://en.wikipedia.org/wiki/Surreal_Numbers;;; Note: some of the comments are in unicode;;; Requires SRFI-9;;;Some Helper functions

2006-07-18T07:03:00.000-07:00

A Surreal Life Lately I have had another psychosis episode again. Another relapse but I overcame it. Anyways I have been working on surreals and the code is much more stable. I will post it to later in the day.

2006-06-26T16:21:00.000-07:00

Progress on Surreal Numbers(Got this from Nymphs of a waterfall Here is an updated version of what I was working on in last post. I am going to add recursive enumeration using streams.;;;Surreal numbers are a set of numbers of which there is a left and right set.;;;More information can be found at http://en.wikipedia.org/wiki/Surreal_Numbers;;;x = (Xl, Xr);;;Some Helper functions;;This tests if

2006-06-07T07:21:00.000-07:00

Surreal Numbers Lately I have put my hardcore Go AI stuff on hold until I get Artificial Intelligence: A Modern Approach . Now I am revisiting a data-type to deal with surreal numbers in scheme. Here is what I have so far. It is very unfinished. ;;; Surreal numbers are a set of numbers of which there is a left and right set;;; I used the text Surreal Numbers by D. E. Knuth to write this.;;;

2006-05-27T07:13:00.000-07:00

Reasoned Schemer Short overview Fans of prolog and other logical programming languages will not be disappointed in this new book that just came. It deals with the extension of functional programming to include logic programming. It is presented in a dialogue manner that is easy to understand for beginners and advanced people. Reading the little or seasoned schemer books helps but is not required

2006-05-21T06:21:00.000-07:00

Siscweb Lately I have been working on a website using siscweb. It is a really great framework that allows you to use scheme in a continuation web based framework. The resulting website can also be deployed in a J2EE application server which is different from other frameworks based in scheme which require their own server. For more information see SISCweb website

2006-05-14T07:23:00.000-07:00

Zobrist Hashing Okay, this is a new post in awhile. Currently I have read through the little schemer and done most of the exercises. I have also moved on and am currently reading the the seasoned schemer. I will put the Beyond Lisp idea on hold until I can get to the the reasoned schemer . Lately I have been programming parts of a Go AI. I am planning for this AI eventually to use (

2005-10-23T03:58:00.001-07:00

Implementation of Beyond LispCurrently I am trying to implement the idea that I have which is outlined at Beyond-lisp-notes . Basically I will add the mu special form to the scheme language. This will take a formal logic expression and see if it holds true for a computer program. The syntax we will use is an automated theorm prover in first order logic. I am also thinking of adding mu-let which

2005-10-21T05:06:00.000-07:00

Informal proof of application of the theory of groups to computer programs. First we take a binary operation we call our computer program. A binary operation in groups can be any abstract thing. This abstract thing is founded upon the idea of In this proof we use the binary operation as the evaluation of a computer program. Closure can be proven in the computer program by the simple fact that

2005-10-17T10:32:00.000-07:00

Beyond Lisp I have been working on a idea from John McCarthy's lecture on Beyond Lisp for awhile. There is now a wiki page up that discusses the idea (See links). It basically adds a new operator to lisp that allows you to reason using formal logic with a computer. It reasons on both inputs and outputs on the computer program. The next few posts will be outlining operators to the scheme

My Journey To Scheme

2005-06-30T07:15:00.000-07:00

I had been wanting to program for awhile. Since I was very little of course when I was about 10. I started off with Visual Basic which is such a depressing programming language. I lamented in a great deal of depressing programming languages for awhile. From VB to Java to HTML to javascript and the list would go on almost indefinitely. Until one fateful day I discovered lisp. The odd syntax really