Abstract
In computer science a number of mathematical disciplines are used: Programming language theory and automata theory use mathematical logic, formal systems, algebra, and recursive functions. The study of program structure and program verification uses graph theory as well as some of the above disciplines. The study of computability—'what can we compute and how is it done most efficiently?'‐‐draws heavily on combinatorics and complexity theory. Parallel cooperating programs are described using temporal logic or special temporal graphs called Petri nets.
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 callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: 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.
