documents   about archive   about project   Andrei Ershov   in Russian

Archive Editorial activity Reviews Abstract

	Abstract of the paper by J.M. Barzdyn "Complexity of programs which recognize whether natural numbers not exceeding n belong to a recursively enumerable set". Date: 09.04.1969 Original document language: English Authors: Andrei Petrovich Ershov Images of pages: 1 Back Next document (Abstract) Previous document (Abstract )
	Switch to Russian | Search | Advanced search | Folders | Themes

Home Help in Russian Webmaster © Ershov's Institute of Informatics Systems, 2000-2016