Elementary Complexity and von Neumann Algebras

Details Elementary Complexity and von Neumann Algebras Elementary Complexity and von Neumann Algebras

2009-12-29

arxiv.org/abs/0912.5342v1

Computer Science

Computational Complexity

22 pages, 2 figures, journal submission

Scientific paper

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the hyperfinite $\mathrm{II}_1$ factor, starting from the class of Kalmar recursive functions. More methodologically, we address the problem of finding the right perspective from which to view the new relation between computation and combinatorial aspects in operator algebras. The rich structure of discrete invariants may provide a mathematical setting able to shed light on some basic combinatorial phenomena that are at the basis of our understanding of complexity.

Affiliated with

Also associated with

No associations

Rating

Elementary Complexity and von Neumann Algebras 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 Elementary Complexity and von Neumann Algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elementary Complexity and von Neumann Algebras will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63174