Abstract Computability of Non-deterministic Programs over Various Data Structures

Authors:
Nikolaj S. Nikitchenko
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 7
Cited 1

Necessary and sufficient conditions for the universality of programming formalisms

Acta Informatica
Deterministic and nondeterministic computation, and horn programs, on abstract data types

Journal of Logic Programming
Map theory

Theoretical Computer Science
Hereditarily-finite sets, data bases and polynomial-time computability

Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Domains for Denotational Semantics

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Abstract computability on algebraic structures

Proceedings on Algorithms in Modern Mathematics and Computer Science

Composition-nominative aspects of address programming

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partial multi-valued functions represent semantics of nondeterministic programs. The notion of naturally computable partial multi-valued function is introduced and algebraic representations of complete classes of naturally computable functions over various data structures are constructed.