shows

P2371
predicate

Indicates that one entity presents, displays, or makes another entity visible or known to an audience or observer.

All labels observed (5)

Label Occurrences
shows canonical 1,086
entertainment 15
oftenShows 5

Sample triples (1,114)

Subject Object
Nash embedding theorem intrinsic Riemannian geometry can be realized as extrinsic geometry in Euclidean space
Russell’s paradox naive comprehension leads to contradiction
Russell’s paradox unrestricted set formation is inconsistent
Russell’s paradox there is no set of all sets that are not members of themselves
Russell’s paradox limitations of naive set theory
Rock-Art Sites of Tadrart Acacus transition from humid to arid climate
Rock-Art Sites of Tadrart Acacus evolution of subsistence strategies
Rock-Art Sites of Tadrart Acacus development of pastoralism
Rock-Art Sites of Tadrart Acacus early caravan routes
Schwarzschild Penrose diagram event horizon as null surface
Schwarzschild Penrose diagram singularity as spacelike boundary
Schwarzschild Penrose diagram black hole interior region
Schwarzschild Penrose diagram exterior asymptotically flat region
Schwarzschild Penrose diagram white hole region
Schwarzschild Penrose diagram second asymptotically flat region
Schwarzschild Penrose diagram maximally extended Schwarzschild solution
Schwarzschild Penrose diagram possible timelike worldlines
Schwarzschild Penrose diagram possible null geodesics
Schwarzschild Penrose diagram impossibility of escaping from inside event horizon
Schwarzschild Penrose diagram impossibility of entering white hole region from outside
Barber paradox some apparently simple conditions are inconsistent
Barber paradox not every description determines a possible object
Barber paradox need for restrictions on set or property formation
The Knowledge Complexity of Interactive Proof Systems existence of zero-knowledge proofs for some NP problems under cryptographic assumptions
Interactive Proofs and the Hardness of Approximating Cliques strong inapproximability bounds for clique
Interactive Proofs and the Hardness of Approximating Cliques it is computationally hard to approximate maximum clique within certain factors
Interactive Proofs and the Hardness of Approximating Cliques interactive proof techniques can yield hardness of approximation results
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED Feynman rules reproduce Tomonaga–Schwinger operator results order by order
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED diagrammatic expansion corresponds to time-ordered products of interaction terms
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED Lorentz invariance of the perturbation expansion can be maintained
Cantor’s paradox power set of any set has strictly greater cardinality than the set
Cantor’s paradox a universal set would have cardinality strictly less than its power set and equal to it
“A fast learning algorithm for deep belief nets”
surface form: A fast learning algorithm for deep belief nets
deep belief nets can achieve low error rates on MNIST
Burali-Forti paradox naive set theory with unrestricted comprehension is inconsistent
von Neumann paradox in set theory existence of paradoxical decompositions under certain group-theoretic conditions
von Neumann paradox in set theory failure of finitely additive invariant measures on some groups
von Neumann paradox in set theory counterintuitive consequences of the axiom of choice
Rubinstein bargaining model more patient player obtains larger share of surplus
Rubinstein bargaining model cost of delay affects bargaining power
Rubinstein bargaining model time preferences determine division of surplus
Theorema Egregium extrinsic curvature is not needed to determine Gaussian curvature
Theorema Egregium curvature of a surface can be determined by measurements within the surface
Gauss–Bonnet theorem (early form) curvature can be determined intrinsically
Milliways live broadcast of the universe ending via predicate surface "entertainment"
Fair Play real-life couples negotiating chores
Fair Play strategies for more equal partnerships
Fair Play effects of inequality on children
Bode plot magnitude versus frequency
Bode plot phase versus frequency
Task Manager CPU usage