Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract    study the problem of interactive searching in a set of numbers using comparison queries, under the assumption that each ansr can be erroneous with a constant probability  p  and that a given reliability 0  q   x  has to be found with a given accuracy 1/ n ), discrete bounded ( x  e {1, ...,  n }) and discrete unbounded (the unknown number  n  can be any positive integer).  prove that in all cases the search is feasible for any  n  and  q  iff  p  ≠1/2. For  p  ≠ 1/2 an O(log n ) searching algorithm is given in the continuous case and O(log 2  n ) algorithms in the discrete bounded and unbounded cases. For  p   p  > 2/3, O(log n ) algorithms are given in each version of search.
['Andrzej Pelc']
I am writing a research paper on a idea Searching with known error probability
[{"from": "human", "value": "I am writing a research paper on a idea Searching with known error probability"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract    study the problem of interactive searching in a set of numbers using comparison queries, under the assumption that each ansr can be erroneous with a constant probability  p  and that a given reliability 0  q   x  has to be found with a given accuracy 1/ n ), discrete bounded ( x  e {1, ...,  n }) and discrete unbounded (the unknown number  n  can be any positive integer).  prove that in all cases the search is feasible for any  n  and  q  iff  p  \u22601/2. For  p  \u2260 1/2 an O(log n ) searching algorithm is given in the continuous case and O(log 2  n ) algorithms in the discrete bounded and unbounded cases. For  p   p  > 2/3, O(log n ) algorithms are given in each version of search."}]