Civil Rights
Movements, leaders, victories and the continuing fight for equality.
q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
Explore the people, places, events, achievements, struggles and stories that shaped our journey.
Movements, leaders, victories and the continuing fight for equality.
Innovation, patents, science, technology and world-changing contributions.
Pioneers, champions, Negro Leagues, records, activism and excellence.
Meet the people whose lives, choices and achievements shaped the journey.
Black towns, communities, institutions and places where history happened.
Moments that changed communities, movements, institutions and the nation.
In August 1908, a white mob attacked Springfield, Illinois’s Black community, destroying homes and businesses and lynching two Black men. National outrage over the violence helped spur the movement that created the NAACP the following year.
MORE →Reflects the personal views, recollections, and perspective of the author, Mike Davis.
This is a personal recollection on the Move fire on May 13, 1985
 | |
| Discipline | Mathematics |
|---|---|
| Language | English |
| Edited by | Susanne C. Brenner |
| Publication details | |
Former names | Mathematical Tables and Other Aids to Computation |
| History | 1943–present |
| Publisher | |
| Frequency | Bimonthly |
| Delayed, after 5 years | |
| 2.417 (2020) | |
| Standard abbreviations | |
| ISO 4 | Math. Comput. |
| MathSciNet | Math. Comp. |
| Indexing | |
| CODEN | MCMPAF |
| ISSN | 0025-5718 (print) 1088-6842 (web) |
| LCCN | gs45000054 |
| JSTOR | 00255718 |
| OCLC no. | 24991469 |
| Links | |
Mathematics of Computation is a bimonthly mathematics journal focused on computational mathematics. It was established in 1943 as Mathematical Tables and Other Aids to Computation, obtaining its current name in 1960.[1][2] Articles older than five years are available electronically free of charge.
Past editors have included Raymond C. Archibald, D. H. Lehmer, Eugene Isaacson, and Walter Gautschi, with Leslie Comrie providing 'cooperation' in editing during 1944-1949.[2]: xvii–xviii
The journal is abstracted and indexed in Mathematical Reviews, Zentralblatt MATH,[3] Science Citation Index,[4] CompuMath Citation Index, and Current Contents/Physical, Chemical & Earth Sciences.[4] According to the Journal Citation Reports, the journal has a 2024 impact factor of 2.1.[5]
  | This article about a mathematics journal is a stub. You can help Wikipedia by adding missing information. See tips for writing articles about academic journals. Further suggestions might be found on the article's talk page. |
Source: Wikipedia. Article content is retrieved live through the MediaWiki API.
Mathematics of Computation is a bimonthly mathematics journal focused on computational mathematics. It was established in 1943 as Mathematical Tables and Other Aids to Computation, obtaining its current name in 1960. Articles older than five years are available electronically free of charge. Past editors have included Raymond C. Archibald, D. H. Lehmer, Eugene Isaacson, and Walter Gautschi, with Leslie Comrie providing 'cooperation' in editing during 1944-1949.
Ernst Hairer (born 19 June 1949) is a professor of mathematics at the University of Geneva known for his work in numerical analysis. His PhD was completed at the University of Innsbruck. He is the father of the mathematician Martin Hairer, who won the Fields Medal in 2014. Hairer is a member of the editorial boards for the journals Mathematics of Computation and Journal of Scientific Computing. He wrote, with others, Solving Ordinary Differential Equations (Hairer, Nørsett, Wanner) and L'analyse au fil de l'histoire (Hairer, Wanner).
Foundations of Computational Mathematics (FoCM) is an international nonprofit organization that supports and promotes research at the interface of mathematics and computation. It fosters interaction among mathematics, computer science, and other areas of computational science through conferences, events and publications.
In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation using an algorithm, how efficiently they can be solved and to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?". In order to perform a rigorous study of computation, computer scientists work with a mathematical abstraction of computers called a model of computation. Several models exist for this purpose, such as the Turing machine. Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" model of computation (see Church–Turing thesis). It might seem that the potentially infinite memory capacity is an unrealizable attribute, but any decidable problem solved by a Turing machine will always require only a finite amount of memory. So in principle, any problem that can be solved (decided) by a Turing machine can be solved by a computer that has a finite amount of memory.
Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.
MORE →Mae Jemison, aboard Space Shuttle Endeavour in 1992.
