Active Learning of Recursive Functions by Ultrametric Algorithms

Author(s):  
Rūsiņš Freivalds ◽  
Thomas Zeugmann
1992 ◽  
Vol 57 (1) ◽  
pp. 53-81 ◽  
Author(s):  
William I. Gasarch ◽  
Mark G. Pleszkoch ◽  
Robert Solovay

AbstractWe prove that the set of all recursive functions cannot be inferred using first-order queries in the query language containing extra symbols [+ , <]. The proof of this theorem involves a new decidability result about Presburger arithmetic which is of independent interest. Using our machinery, we show that the set of all primitive recursive functions cannot be inferred with a bounded number of mind changes, again using queries in [+, <]. Additionally, we resolve an open question in [7] about passive versus active learning.


1990 ◽  
Vol 35 (5) ◽  
pp. 471-472
Author(s):  
Herbert J. Klausmeier

2017 ◽  
Vol 85 (8) ◽  
pp. 814-825 ◽  
Author(s):  
Ajeng J. Puspitasari ◽  
Jonathan W. Kanter ◽  
Andrew M. Busch ◽  
Rachel Leonard ◽  
Shira Dunsiger ◽  
...  

2008 ◽  
Author(s):  
Lisa Wagner ◽  
Chandra M. Mehrotra
Keyword(s):  

2006 ◽  
Author(s):  
Kimberly A. Barchard ◽  
Larry A. Pace

Sign in / Sign up

Export Citation Format

Share Document