Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach

Details Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach

2010-11-11

arxiv.org/abs/1011.2790v1

Bulletin of the Section of Logic 39/3-4, 2010

Computer Science

Logic in Computer Science

13 pages

Scientific paper

In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-automatic local transition functions. In this approach we completely avoid axioms as necessary notion of deduction theory and therefore we can use cyclic proofs without additional problems. As a result, a theory of massive-parallel proofs within unconventional computing is proposed for the first time.

Affiliated with

Also associated with

No associations

Rating

Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach 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 Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203198