Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A polynomial method of constructing a non-deterministic (NP) turing machine

A formal, data technique applied in the field of polynomials for constructing non-deterministic (NP) Turing machines, capable of solving problems such as ignorance

Active Publication Date: 2015-12-23
BEIJING BOSI BIOINTELLIGENCE TECH
View PDF7 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Furthermore, it is not known whether a non-deterministic Turing machine can be constructed from a deterministic Turing machine

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A polynomial method of constructing a non-deterministic (NP) turing machine
  • A polynomial method of constructing a non-deterministic (NP) turing machine
  • A polynomial method of constructing a non-deterministic (NP) turing machine

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] In general, a non-deterministic Turing machine (NTM) implemented according to an embodiment of the present invention includes four subsystems: (1) a spatial binary enumeration system; (2) a 3-dimensional relational system; (3) a simulated human logic system ; and (4) a bijective collective memory system.

[0026] For example, see figure 1, shows a schematic diagram of a non-deterministic Turing machine (NTM) 100 according to an embodiment of the present invention. NTM 100 includes memory 102 referred to herein as a "bijective set" memory because it contains data representing bidirectional relationships as will be described in more detail below. Memory 102 is also referred to herein as a "knowledge base," as that term is used in US Patent No. 6,611,841. NTM 100 also includes a simulated human logic system 104, which is also referred to herein as a cognitive logic unit or a parallel information processor. Cognitive logic unit 104 does not work in the same way as a trad...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A nondeterministic Turning machine (NTM) performs computations using a spatial binary enumeration system, a three-dimensional relation system, a simulated-human logic system, and a bijective-set memory system. The NTM may be used to perform a variety of computational tasks, such as multiple sequence alignment, factorization, and other nondeterministic polynomial algorithms in polynomial time. The NTM may be constructed by a deterministic Turing machine (DTM) using the four systems listed above.

Description

Background technique [0001] The term "Turing machine" refers to a theoretical computing device that performs computations in the manner first postulated by Alan Turing. Most modern electronic computers are instantiations of Turing machines. In general, a Turing machine can be understood as a device that has the ability to read symbols stored on an endless tape and write symbols to an endless tape. The tape can be initialized to contain one or more symbols. Furthermore, a Turing machine has a "state" that can change over time. Such states are often expressed using simple labels, such as numbers (eg, states 1, 2, and 3) or letters (eg, states A, B, and C), but the specific labels used to identify the states are not important. [0002] A Turing machine includes a read / write head that is positioned at a particular location on the tape (referred to as the "current location") at any particular time. The Turing machine reads the symbol currently stored at the current location on ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F19/00
CPCG06N5/00G06N5/022G06N5/04
Inventor 韩小文
Owner BEIJING BOSI BIOINTELLIGENCE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com