On the classification of recursive languages
type: Item
instance of: scholarly article
title: On the classification of recursive languages
zbMATH Open document ID: 1074.68030
author: John Case
author: A. K. Sharma
author: Frank Stephan
author: Efim Kinber
published in: Information and Computation
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 03D28
zbMATH DE Number: 2083157
zbMATH Keywords: inductive learning
zbMATH Keywords: structural complexity
zbMATH Keywords: Turing degrees
MaRDI profile type: Publication
full work available at URL: j.ic.2004.03.001
OpenAlex ID: W2028185140
cites work: Inductive inference and unsolvability
cites work: Ordinal mind change complexity of language identification
cites work: Inductive inference of formal languages from positive data
cites work: Q4470535
cites work: Machine learning of higher-order programs
cites work: Can finite samples detect singularities of real-valued functions?
cites work: Toward a mathematical theory of inductive inference
cites work: Q5618355
cites work: Definability in the monadic second-order theory of successor
cites work: Q4300060
cites work: ON LEARNING LIMITING PROGRAMS
cites work: On the classification of computable languages
cites work: Comparison of identification criteria for machine inductive inference
cites work: On the role of procrastination in machine learning
cites work: Classification using information
cites work: Language identification in the limit
cites work: Q4146722
cites work: Elementary formal systems, intrinsic complexity, and procrastination
cites work: Monotonic and non-monotonic inductive inference
cites work: The degrees of bi‐immune sets
cites work: Decision problems forω-automata
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Some natural properties of strong-identification in inductive inference
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Recursively enumerable sets of positive integers and their decision problems
cites work: Q5573961
cites work: Q4040890
cites work: Generalized notions of mind change complexity
cites work: Classifying Predicates and Languages
cites work: Q4040892
cites work: On one-sided versus two-sided classification
cites work: Generalization versus classification
cites work: Q5723183
cites work: Characterizations of monotonic and dual monotonic language learning
DOI: 10.1016/J.IC.2004.03.001
description: scientific article; zbMATH DE number 2083157