Abstract
Among many execution methods for programs that can be conceived of, only the standard notion of computation satisfies axioms of algorithmic logic AL and makes inference rules of AL sound. In this sense the axiomatic system of algorithmic logic specifies the semantics of programs. Next, we shall prove that by the relaxing of requirements, e.g. by the rejection of an axiom or an inference rule we shall create a liberal axiomatic system which allows nonstandard (i.e. transfinite and successful) runs of programs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
