Hume, Causation and Two Arguments Concerning God

In Dialogues Concerning Natural Religion, Hume (1779/1993) appeals to his account of causation (among other things) to undermine certain arguments for the existence of God. If 'anything can cause anything', as Hume claims, then the Principle of Causal Adequacy is false; and if the Principle of Causal Adequacy is false, then any argument for God's existence that relies on that principle fails. Of course, Hume's critique has been influential. But Hume's account of causation undermines the argument from evil at least as much as it undermines arguments for theism, or so I argue. I then suggest that Hume's account of causation can be used to formulate an alternative argument against classical theism

Computability and human symbolic output

This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in human history, even at moments in the distant future, this set is finite. But then, given fundamental results in recursion theory, the set will also be recursive, recursively enumerable, axiomatizable, and could be the output of a Turing machine. We then argue that it is impossible to produce a string of symbols that humans could possibly produce but no Turing machine could. Moreover, we show that any given string of symbols that we could produce could also be the output of a Turing machine. Our arguments have implications for Hilbert’s sixth problem and the possibility of axiomatizing particular sciences, they undermine at least two distinct arguments against the possibility of Artificial Intelligence, and they entail that expert systems that are the equals of human experts are possible, and so at least one of the goals of Artificial Intelligence can be realized, at least in principle

Equivalences, Identities, Symmetric Differences, and Congruences in Orthomodular Lattices

It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity of equivalence terms and several other 3 variable expressions involving equivalence terms have been proved to hold in any orthomodular lattice. Symmetric differences have been shown to reduce to complements of equivalence terms. Some congruence relations related to equivalence operations and symmetric differences have been considered.Comment: 13 pages, 1 figure, 1 table; To be published in International Journal of Theoretical Physics, Vol. 42, No. 12 (2003); Web page: http://m3k.grad.hr/pavici

Recommendations on Sampling and Estimation Methodology for Rwanda Agricultural Surveys

Food Security Research Project (FSRP; Rwanda Ministry of Agriculture, Livestock and Forestry; U.S. Agency for International Developmentfood security, food policy, Rwanda, sampling and estimation methodology, Farm Management, Q18,

Vector Generation of Contextual Sets

As quantum contextuality proves to be a necessary resource for universal quantum computation, we present a general method for vector generation of Kochen-Specker (KS) contextual sets in the form of hypergraphs. The method supersedes all three previous methods: (i) fortuitous discoveries of smallest KS sets, (ii) exhaustive upward hypergraph-generation of sets, and (iii) random downward generation of sets from fortuitously obtained big master sets. In contrast to previous works, we can generate master sets which contain all possible KS sets starting with nothing but a few simple vector components. From them we can readily generate all KS sets obtained in the last half a century and any specified new KS sets. Herewith we can generate sufficiently large sets as well as sets with definite required features and structures to enable varieties of different implementations in quantum computation and communication.Comment: 6 pages, 6 figures; Orally presented by M. Pavicic at Quantum Technology International Conference 2018 (QTech 2018), Paris, France, September 5-7, 2018; Extended version: https://www.youtube.com/watch?v=Bw2vItz5tr