Neutrosophic Computability and Enumeration

Abstract

We introduce oracle Turing machines with neutrosophic values allowed in the oracle information and then give some results when one is permitted to use neutrosophic sets and logic in relative computation. We also introduce a method to enumerate the elements of a neutrosophic subset of natural numbers.

Keywords

• computability
• oracle Turing machines
• neutrosophic sets
• neutrosophic logic
• recursive enumerability
• oracle computation
• criterion functions