Conditional Equations - Strings

CE-S ( C onditional E quations - S Trings) is a formal language for modeling algorithms . This language works on the basis of conditional equations which, depending on the evaluation of the condition, manipulate given strings with the help of certain operations. Functions that can be calculated with CE-S correspond to the calculable functions according to the Church-Turing thesis . This means that with the help of CE-S every function can be calculated that humans can calculate with mathematical means. CE-S also offers the possibility of simply calculating the effort required for operations and then assigning it to an effort class. The modeling of an algorithm in CE-S is based on the so-called CE-S specification .

specification

A CE-S specification consists of the following sections:

section	designation	Explanation
spec	Name of the algorithm	Any name
opns	Operation declaration	Form of a declaration: ${\displaystyle f:D_{1}\times D_{2}\times ...\times D_{a}\rightarrow D}$ f is the function name D are types (argument types and value type), i.e. any set of constants declaration with: ${\displaystyle c:\rightarrow D}$
vars	Variable declarations	Declaration of a variable in the form (typed) ${\displaystyle x\in D}$ x is a variable name and D a type (again any quantity)
eqns	Conditional equations	Conditional equation of the form L = R if b L, R are terms of the same type D b is a term of the type Boolean

See also

• Turing machine
• Predictability