ITHEA Classification Structure > F. Theory of Computation > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY > F.2.m Miscellaneous
ALGORITHMIC DECIDABILITY OF COMPUTER PROGRAM-FUNCTIONS LANGUAGE PROPERTIES
By: Nikolay Kosovskiy (3191 reads)
Rating:
(1.00/10)
article:
SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY
· A LANGUAGE USING QUANTIFIERS FOR DESCRIPTION OF ASSERTIONS ABOUT ...
· ALGORITHMIC DECIDABILITY OF COMPUTER PROGRAM-FUNCTIONS LANGUAGE PROPERTIES
· POLYNOMIAL-TIME EFFECTIVENESS OF PASCAL, TURBO PROLOG, VISUAL PROLOG AND ...
· |
Login World Clock |

[ Execution time: 0.08 secs ] [ Memory usage: 7.51MB ] [ GZIP Disabled ] [ Server load: 0.58 ]

Powered by Tikiwiki CMS/Groupware