universal function
31Universal prescriptivism — Not to be confused with Linguistic prescription. Universal prescriptivism (often simply called prescriptivism) is the meta ethical view which claims that, rather than expressing propositions, ethical sentences function similarly to imperatives… …
32Universal law of generalization — The universal law of generalization is a theory of cognition originally posited by Roger Shepard. According to it, the probability that a response to one stimulus will be generalized to another will be a function of the distance between the two… …
33Universal extra dimension — In particle physics, the ADD model, also known as the model with large extra dimensions, is an alternative scenario to explain the weakness of gravity relative to the other forces. This theory requires that the fields of the Standard Model are… …
34universal quantifier — Logic. a quantifier indicating that the sentential function within its scope is true for all values of any variable included in the quantifier. Cf. existential quantifier. * * * …
35universal Turing machine — noun A Turing machine capable of simulating the behavior of any Turing machine. See Also: Turing machine, Turing complete, Turing function …
36universal quantifier — u′niver′sal quan′tifier n. pho logic a quantifier indicating that the sentential function within its scope is true for all values of any variable included in the quantifier • Etymology: 1935–40 …
37universal-wound — /ˈjunəvɜsəl ˌwaʊnd/ (say yoohnuhversuhl .wownd) adjective (of an electric motor) wound so that it will function with either DC or low frequency AC supply; commonly used in electrical household appliances …
38Activation function — In computational networks, the activation function of a node defines the output of that node given an input or set of inputs. A standard computer chip circuit can be seen as a digital network of activation functions that can be ON (1) or OFF (0) …
39Basis (universal algebra) — Definitions The basis (or reference frame) of a (universal) algebra is a function b that takes some algebra elements as values b(i) and satisfies either one of the following two equivalent conditions. Here, the set of all b(i) is called basis set …
40Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …
