Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STACS

1999

Springer

1999

Springer

Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identiﬁcation). His machine, on the successive graph points of f, outputs a corresponding inﬁnite sequence of programs p0, p1, p2, . . ., and, for some i, the programs pi, pi+1, pi+2, . . . each compute a variant of f which diﬀers from f at only ﬁnitely many argument places. A machine with this property is called general purpose. The sequence pi, pi+1, pi+2, . . . is called a ﬁnal sequence. For Harrington’s general purpose machine, for distinct m and n, the ﬁnitely many argument places where pi+m fails to compute f can be very diﬀerent from the ﬁnitely many argument places where pi+n fails to compute f. One would hope though, that if Harrington’s machine, or an improvement thereof, inferred the program pi+m based on the data points f(0), f(1), . . ., f(k), then pi+m would make very few mistakes computing f at the “near fu...

Related Content

Added |
05 Aug 2010 |

Updated |
05 Aug 2010 |

Type |
Conference |

Year |
1999 |

Where |
STACS |

Authors |
John Case, Keh-Jiann Chen, Sanjay Jain |

Comments (0)