Everything about Computer for operations with functions

🧭 Start here: a 6-step reading path

1. Read the overview: Computer for operations with functionsA 5-minute orientation
2. Pick up a classic book: Software EngineeringThe most-reprinted book on the subject
3. Go sideways: Complex-base systemA closely related topic
4. Go sideways: Square numberA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

• Software EngineeringRoger S. Pressman, Bruce Maxim · 1982
• Computer networkingJames F. Kurose, Keith W. Ross · 1900
• Modern Operating SystemsAndrew S. Tanenbaum, Herbert Bos · 1992
• C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
• Invitation to Computer ScienceG. Michael Schneider, Judith L. Gersting · 1995
• Computer scienceJ. Glenn Brookshear, Brookshear · 1985
• Structure and Interpretation of Computer Programs (SICP)Harold Abelson, Gerald Jay Sussman · 1985
• Mathematical structures for computer scienceJudith L. Gersting · 1982

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Complex-base system In arithmetic, a complex-base system is a positional numeral system whose radix is an imaginary (proposed by Donald Knuth in 1955) or complex number (proposed…
• Square number In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with…
• Triangular number The triangular numbers or triangle numbers are the sequence of positive integers that can be represented as a lattice of points arranged in an equilateral…
• Anderson acceleration In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations…
• FEE method In mathematics, the FEE method, or fast E-function evaluation method, is the method of fast summation of series of a special form. It was constructed in…
• Bailey–Borwein–Plouffe formula The Bailey–Borwein–Plouffe formula (BBP formula) is a formula for π. It was discovered in 1995 by Simon Plouffe and is named after the authors of the article…
• Hash function A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support…
• Divisor summatory function In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic…