A New Approach to Computing
Systems of property based types (PBT) overcome many of the limitations of current automated systems because they are built on a logical foundation that differs remarkably from those of conventional digital computers and artificial intelligence (AI). In particular, systems of property based types can validly characterize anything imaginable, to answer questions in the absence of complete information, and to calculate with infinite structures and domains. The power of PBT systems derives from their unique semantic structure, ability to guarantee valid results, expressiveness, and use of abstraction, generalization and analogy.
PBT (property based type) systems overcome many of the limitations of current automated systems because they are built on a logical foundation that differs remarkably from those of conventional digital computers and artificial intelligence (AI). In particular, systems of property based types can validly characterize anything imaginable, answer questions in the absence of complete information, and calculate with infinite structures and domains. The power of PBT systems derives from their unique semantic structure, ability to guarantee valid results, expressiveness, and use of abstraction, generalization and analogy.
The logic of property based types is
a theory of reasoning with structures and processes analogous to those of
concepts and deductive reasoning in the human mind. PBT logic is a sound,
incomplete, and intensional calculus of types. It contrasts with classical
logic which is a complete and extensional calculus of propositions. The logic
of digital computers, programming languages, and AI is built on classical
logic, but calculates with usually inaccurate models and is limited to finite
structures and domains. As a result,
those systems lack consistency and reliability.
A PBT reasoning engine is an
instruction set architecture that incorporates PBT logic using integrated
circuits. It implements the structures and processes of PBT logic in electronic
circuits and includes other necessary functionality to complete a processor.
The reasoning engine is supported by an operating system that provides system
level and shared functionality analogous to that of conventional digital
computers.
Omega is a general purpose problem
solving language that gives full access to the logic of property based
types. It is an informal conversational language that shares many of the
characteristics of natural language. It enables specifications and applications
beyond the capabilities of traditional programming languages. It is declarative
and side-effect free. Omega is a pure calculus of types where each type
characterizes a category of things.
PBT systems along with the PBT reasoning engine and the Omega problem solving language can dramatically improve the quality, cost-effectiveness and breadth of application of automated systems.