Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above

Consider a scenario in which an algorithmic machine, M, is being fed the graph of a computable function f . M is said to finitely identify f just in case after inspecting a finite portion of the graph of f it emits its first conjecture which is a program for f , and it never abandons this conjecture thereafter. A team of machines is a multiset of such… (More)