Exploration in Algorithm Engineering: Modeling Algorithms
Sabah Al-Fedaghi

TL;DR
This paper proposes a diagrammatical definition of algorithms using a new modeling machine called a thinging machine, aiming to bridge the gap between formal and informal algorithm representations and enhance practical applicability.
Contribution
It introduces the thinging machine, a novel modeling framework with five actions, to define algorithms in a middle-ground between formal and informal representations.
Findings
The definition applies to Turing machines and FSMs.
It serves as a practical middle-ground for algorithm representation.
The approach bridges theory and implementation in algorithm engineering.
Abstract
According to some algorithmicists, algorithmics traditionally uses algorithm theory, which stems from mathematics. The growing need for innovative algorithms has caused increasing gaps between theory and practice. Originally, this motivated the development of algorithm engineering, which is viewed as experimental techniques related to software engineering. Currently, algorithm engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to produce better algorithms with high practical impact. Still, researchers have questioned whether the notion of algorithms can be defined in a fully generable way and discussed what kinds of entities algorithms actually are. They have also struggled to maintain a view that formulates algorithms mathematically (e.g., Turing machines and finite-state machines [FSMs]) while adapting a more…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Malware Detection Techniques · Machine Learning and Algorithms
