Abstract
Given a mathematical operator, how should one reason about the outcome of its repeated invocation? This question is relevant in both mathematics and computer science, where iterative operator invocations are core, algorithmic elements.An initial approach, which one may naturally follow, is to try the operator in diverse situations, observe the results, and suggest a general outcome. Such an approach embodies operational reasoning, where inference derives from ‘behaviours’ of invocation sequences. This may indeed reveal some behavioural characteristics, but is it sufficient for rigorous argumentation of the general outcome? Not quite.
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.
