And the Robot Asked "What do you say I am?" Can Artificial Intelligence Help Theologians and Scientists Understand Free Moral Agency?

Concepts of human beings as free and morally responsible agents are shared culturally by scientists and Christian theologians. Accomiplishments of the "artificial intelligence" (AI) branch of computer science now suggest the possibility of an advanced robot mimicking behaviors associated with free and morally responsible agency. The author analyzes some specific features theology has expected of such agency, inquiring whether appropriate AI resources are available for incorporating the features in robots. Waiving questions of whether such extraordinary robots will be constructed, the analysis indicates that they could be, furnishing useful new scientific resources for understanding moral agency

Retraction and Generalized Extension of Computing with Words

Fuzzy automata, whose input alphabet is a set of numbers or symbols, are a formal model of computing with values. Motivated by Zadeh's paradigm of computing with words rather than numbers, Ying proposed a kind of fuzzy automata, whose input alphabet consists of all fuzzy subsets of a set of symbols, as a formal model of computing with all words. In this paper, we introduce a somewhat general formal model of computing with (some special) words. The new features of the model are that the input alphabet only comprises some (not necessarily all) fuzzy subsets of a set of symbols and the fuzzy transition function can be specified arbitrarily. By employing the methodology of fuzzy control, we establish a retraction principle from computing with words to computing with values for handling crisp inputs and a generalized extension principle from computing with words to computing with all words for handling fuzzy inputs. These principles show that computing with values and computing with all words can be respectively implemented by computing with words. Some algebraic properties of retractions and generalized extensions are addressed as well.Comment: 13 double column pages; 3 figures; to be published in the IEEE Transactions on Fuzzy System

Separable GPL: Decidable Model Checking with More Non-Determinism

Generalized Probabilistic Logic (GPL) is a temporal logic, based on the modal mu-calculus, for specifying properties of branching probabilistic systems. We consider GPL over branching systems that also exhibit internal non-determinism under linear-time semantics (which is resolved by schedulers), and focus on the problem of finding the capacity (supremum probability over all schedulers) of a fuzzy formula. Model checking GPL is undecidable, in general, over such systems, and existing GPL model checking algorithms are limited to systems without internal non-determinism, or to checking non-recursive formulae. We define a subclass, called separable GPL, which includes recursive formulae and for which model checking is decidable. A large class of interesting and decidable problems, such as termination of 1-exit Recursive MDPs, reachability of Branching MDPs, and LTL model checking of MDPs, whose decidability has been studied independently, can be reduced to model checking separable GPL. Thus, GPL is widely applicable and, with a suitable extension of its semantics, yields a uniform framework for studying problems involving systems with non-deterministic and probabilistic behaviors

Complex Philosophy

As science, knowledge, and ideas evolve and are increased and refined, the branches of philosophy in charge of describing them should also be increased and refined. In this work we try to expand some ideas as a response to the recent approach from several sciences to complex systems. Because of their novelty, some of these ideas might require further refinement and may seem unfinished, but we need to start with something. Only with their propagation and feedback from critics they might be improved. We make a brief introduction to complex systems, for then defining <em>abstraction levels</em>. Abstraction levels represent simplicities and regularities in nature. We make an ontological distinction of absolute being and relative being, and then discuss issues on causality, metaphysics, and determinism

Fuzzy Automata: A Quantitative Review

Classical automata theory cannot deal with the system uncertainty. To deal with the system uncertainty the concept of fuzzy finite automata was proposed. Fuzzy automata can be used in diverse applications such as fault detection, pattern matching, measuring the fuzziness between strings, description of natural languages, neural network, lexical analysis, image processing, scheduling problem and many more. In this paper, a methodical literature review is carried out on various research works in the field of Fuzzy automata and explained the challenging issues in the field of fuzzy automata