scientific article
From MaRDI portal
Publication:3877665
zbMath0437.03018MaRDI QIDQ3877665
Rolf Wiehagen, Rūsiņš Freivalds
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artificial intelligence (68T99) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (27)
Trees and learning ⋮ Robust learning -- rich and poor ⋮ The complexity of universal text-learners ⋮ On the power of recursive optimizers ⋮ Learning recursive functions from approximations ⋮ Learning all subfunctions of a function ⋮ On the intrinsic complexity of learning recursive functions ⋮ On the information carried by programs about the objects they compute ⋮ On the complexity of learning programs ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ Learning recursive functions: A survey ⋮ Aggregating inductive expertise on partial recursive functions ⋮ Characterizing language identification in terms of computable numberings ⋮ On the Amount of Nonconstructivity in Learning Recursive Functions ⋮ Hypothesis spaces for learning ⋮ Robust learning with infinite additional information ⋮ Costs of general purpose learning ⋮ Closedness properties in ex-identification ⋮ Input-dependence in function-learning ⋮ Hypothesis Spaces for Learning ⋮ Learning Finite Variants of Single Languages from Informant ⋮ Robust learning aided by context ⋮ Learning classes of approximations to non-recursive functions. ⋮ The complexity of universal text-learners. ⋮ Learning to win process-control games watching game-masters ⋮ Training sequences ⋮ Inductive inference with additional information.
This page was built for publication:
