Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a strong bimonoid P,  introduce P-valued non-deterministic Turing machines (P-NTM), P-valued non-deterministic Turing machines with classical transition (P-NTMc), P-valued deterministic Turing machines (P-DTM) and P-valued non-deterministic Turing machines with the tape-head no remove (P-NTMS).  adapt depth-first and width-first methods for defining the ight of acceptance of languages recognized by Turning machines. And  study some basic properties of P-NTM, P-NTMc, P-NTMS. Moreover,  prove that variants of P-NTM with changing its P-valued initial function have the same por as P-NTM. These conclusions still hold for P-NTMc and P-NTMS.
['Ping Li', 'Yongming Li', 'Shengling Geng']
I am writing a research paper on a idea Weighted Turing machines over strong bimonoids
[{"from": "human", "value": "I am writing a research paper on a idea Weighted Turing machines over strong bimonoids"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a strong bimonoid P,  introduce P-valued non-deterministic Turing machines (P-NTM), P-valued non-deterministic Turing machines with classical transition (P-NTMc), P-valued deterministic Turing machines (P-DTM) and P-valued non-deterministic Turing machines with the tape-head no remove (P-NTMS).  adapt depth-first and width-first methods for defining the ight of acceptance of languages recognized by Turning machines. And  study some basic properties of P-NTM, P-NTMc, P-NTMS. Moreover,  prove that variants of P-NTM with changing its P-valued initial function have the same por as P-NTM. These conclusions still hold for P-NTMc and P-NTMS."}]