Live briefing
Everything about Algorithm characterizations
Attempts to formalize the concept of algorithms
Algorithm characterizations are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers are actively working on this problem. This article will present some of the "characterizations" of the notion of "algorithm" in more detail. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Algorithm characterizationsA 5-minute orientation
- Pick up a classic book: Mathematical Modeling in Mechanics of Granular MaterialsThe most-reprinted book on the subject
- Read the landmark paper: Theoretical development of the history matching method for subsurface characterizations based on simulated annealing algorithmCited 16 times
- Go sideways: Church–Turing thesisA closely related topic
- Go sideways: History of the Church–Turing thesisA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
- The problem of definition
- Chomsky hierarchy
- Features of a good algorithm
- 1881 John Venn's negative reaction to W. Stanley Jevons's Logical Machine of 1870
- 1943, 1952 Stephen Kleene's characterization
- 1954 A. A. Markov Jr.'s characterization
- 1936, 1963, 1964 Gödel's characterization
- 1967 Minsky's characterization
- 1967 Rogers' characterization
- 1968, 1973 Knuth's characterization
- 1972 Stone's characterization
- 1995 Soare's characterization
🏆 Landmark papers (most cited)
Theoretical development of the history matching method for subsurface characterizations based on simulated annealing algorithm
Solution Point Characterizations and Convergence Analysis of a Descent Algorithm for Nonsmooth Continuous Complementarity Problems
Information-Theoretic Characterizations of Generalization Error for the Gibbs Algorithm
Classification algorithm for congenital Zika Syndrome: characterizations, diagnosis and validation
The Schur algorithm and coefficient characterizations for generalized Schur functions
Maximum matching width: New characterizations and a fast algorithm for dominating set
All-path convexity: two characterizations, general position number, and one algorithm
📚 Books worth reading
Mathematical Modeling in Mechanics of Granular MaterialsOxana Sadovskaya · 2012
Computer Algebra and Materials PhysicsAkihito Kikuchi · 2018- 📕The game of cops and robbers on graphsAnthony Bonato · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Church–Turing thesis In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers…
- History of the Church–Turing thesis The history of the Church–Turing thesis ("thesis") involves the history of the development of the study of the nature of functions whose values are effectively…
- Computable function Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table…
- Effective method In metalogic, mathematical logic, and computability theory, an effective method or effective procedure is a finite-time, deterministic procedure for solving…
- Algorithm In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve…
- Turing reduction In computability theory, a Turing reduction from a decision problem A to a decision problem B is an oracle machine that decides problem A given an oracle…