Skip to main content
Article thumbnail
Location of Repository

The N-dimensional Computing Machine Postulate

By Peraphon Sophatsathit

Abstract

This paper postulates an ideal N-dimensional computing machine that operates in an unconventional manner. How the machine will be built is still undecided, but is architected based on simple building blocks that generate collective scalability. The postulate was motivated by The Poincare Conjecture that inspires atypical approach to solve existing problems in higher dimensions. This postulate aims at achieving consistency of the problem formulation process. One must re-think the scope of a given problem domain in an extraordinary manner that will dictate all subsequent operations, i.e., problem representation, transformation, algorithmic derivation, solving process, and solution archive. The ultimate objective of this postulate is to revamp current computation process from traditional Turing framework, hoping that the ideal computing machine will resolve the wicked NP problems and put them to rest once and for all. Keywords: N-dimensional computing machine, collective scalability, simple building blocks

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.188.6939
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://pioneer.netserv.chula.a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.