Blind graph rewriting systems

Details Blind graph rewriting systems Blind graph rewriting systems

2012-04-16

arxiv.org/abs/1204.3372v1

Computer Science

Logic in Computer Science

4 pages

Scientific paper

We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we demonstrate that the processor of such a system may have empty instruction set, in a more strong manner than the existing ZISC (zero instruction set computer based on ideas for artificial neural networks) and NISC architecture (no instruction set computing). More precisely, the processor will be forbidden to analyze any information stored in the memory, the latter being the only state of such a machine. This particular paper is to cover an isolated aspect of the idea, specifically, to provide the logical operations embedded into a system without any built-in conditional statements.

Affiliated with

Also associated with

No associations

Rating

Blind graph rewriting systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Blind graph rewriting systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blind graph rewriting systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5965