Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On the algorithmic undecidability of A-completeness for the boundedly determinate functions - MaRDI portal

On the algorithmic undecidability of A-completeness for the boundedly determinate functions

From MaRDI portal

Publication:2562181

Jump to:navigation, search

DOI10.1007/BF01093729zbMath0265.02032OpenAlexW2022579059MaRDI QIDQ2562181

V. A. Buevich

Publication date: 1972

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01093729

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80) Thue and Post systems, etc. (03D03)

Cites Work

This page was built for publication: On the algorithmic undecidability of A-completeness for the boundedly determinate functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2562181&oldid=15311297"