Gamer.Site Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of scientific publications by Albert Einstein - Wikipedia

    en.wikipedia.org/wiki/List_of_scientific...

    Physical Review (ser. 2), 47, 777–780, link: Quantum mechanics. Seminal paper on non-local effects (entanglement) in quantum mechanics. Co-authored with B. Podolsky and N. Rosen. Schilpp 274: 1935: The particle problem in the general theory of relativity: Physical Review (ser. 2), 48, 73–77: General relativity. Co-authored with N. Rosen ...

  3. Orders of magnitude (time) - Wikipedia

    en.wikipedia.org/wiki/Orders_of_magnitude_(time)

    An order of magnitude of time is usually a decimal prefix or decimal order-of-magnitude quantity together with a base unit of time, like a microsecond or a million years.In some cases, the order of magnitude may be implied (usually 1), like a "second" or "year".

  4. Computers and Intractability - Wikipedia

    en.wikipedia.org/wiki/Computers_and_Intractability

    Computers and Intractability: A Guide to the Theory of NP-Completeness is a textbook by Michael Garey and David S. Johnson. [1] It was the first book exclusively on the theory of NP-completeness and computational intractability. [2] The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later ...

  5. The Alignment Problem - Wikipedia

    en.wikipedia.org/wiki/The_Alignment_Problem

    The Alignment Problem: Machine Learning and Human Values is a 2020 non-fiction book by the American writer Brian Christian. It is based on numerous interviews with experts trying to build artificial intelligence systems, particularly machine learning systems, that are aligned with human values.

  6. The Erdős Distance Problem - Wikipedia

    en.wikipedia.org/wiki/The_Erdős_Distance_Problem

    The Erdős Distance Problem is a monograph on the Erdős distinct distances problem in discrete geometry: how can one place points into -dimensional Euclidean space so that the pairs of points make the smallest possible distance set? It was written by Julia Garibaldi, Alex Iosevich, and Steven Senger, and published in 2011 by the American ...

  7. Karp's 21 NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/Karp's_21_NP-complete_problems

    In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.In his 1972 paper, "Reducibility Among Combinatorial Problems", Richard Karp used Stephen Cook's 1971 theorem that the boolean satisfiability problem is NP-complete (also called the Cook-Levin theorem) to show that there is a polynomial time many-one reduction from the ...

  8. Connes embedding problem - Wikipedia

    en.wikipedia.org/wiki/Connes_embedding_problem

    Connes' embedding problem, formulated by Alain Connes in the 1970s, is a major problem in von Neumann algebra theory. During that time, the problem was reformulated in several different areas of mathematics. Dan Voiculescu developing his free entropy theory found that Connes' embedding problem is related to the existence of microstates.

  9. The Public and Its Problems - Wikipedia

    en.wikipedia.org/wiki/The_Public_and_its_Problems

    The Public and Its Problems is a 1927 book by American philosopher John Dewey.In his first major work on political philosophy, Dewey explores the viability and creation of a genuinely democratic society in the face of the major technological and social changes of the 20th century, and seeks to better define what both the 'public' and the 'state' constitute, how they are created, and their ...