Many philosophical problems are rooted in everyday thought, and experimental philosophy uses social scientific techniques to study the psychological underpinnings of such problems. In the case of free will, research suggests that people in a diverse range of cultures reject determinism, but people give conflicting responses on whether determinism would undermine moral responsibility. When prese...

In functional logic programs, rules are applicable independently of textual order, i.e., any rule can potentially be used to evaluate an expression. This is similar to logic languages and contrary to functional languages, e.g., Haskell enforces a strict sequential interpretation of rules. However, in some situations it is convenient to express alternatives by means of compact default rules. Alt...

Using the accepted methods to extract natural system behavior from the Einstein-Hilbert gravitational field tensor equation, a new coordinate transformation is analyzed. It is demonstrated that these extraction methods yield specific contradictions. Two such contradictions are that for an electrically neutral (nonrotating) Schwarzschild configuration there is an infinite redshift surface that i...

The purpose of this paper is to give a brief survey the implications of the theories of modern physics for the doctrine of determinism. The survey will reveal a curious feature of determinism: in some respects it is fragile, requiring a number of enabling assumptions to give it a fighting chance; but in other respects it is quite robust and very difficult to kill. The survey will also aim to sh...

The article is aimed at reconsidering the question if project of econometrics can be read in line with scientific realism. Previously, methodological literature focused on philosophy econometrics, voices criticizing realist interpretations were raised. criticism was showing that econometric models lack robustness. use slightly different methods leads to obtaining and often contrary what suppose...

Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership problem is NP-complete. This implies that this family REC is intrinsically non-deterministic. The natural and immediate definition of unambiguity co...

Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursiontheoretic manner. Here we emphasize the connection between the structure of the recursion schemes and the underlying models of computation. 1998 ACM Subject Classification F.4.1 Mathematical Logic, F.1.1 Models of Computation, F.1.2 Modes of Computation, F.1.3 Complexity Measures and Classes

This paper presents a discriminating approach to detecting the existence of underlying determinism in speech phonemes using the surrogate data method. The discrimination is made using a statistical measurement of neighboring trajectory directions. This approach is experimentally verified with both deterministic and stochastic time series and then applied to speech phonemes from the TIMIT databa...

Watson–Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity ofWatson–Crick automata initiated by Păun et al. [A. Păun, M. Păun, State and transition complexity of Watson–Crick finite automata, in: G. Ciobanu, G. Paun (Eds.), Funda...

The aims of this chapter are to review some aspects of determinism that are familiar to physicists but are little discussed in the philosophical literature and to show how these aspects connect determinism to issues about symmetries in physics, the structure and ontological status of spacetime, predictability, and computability. It will emerge that in some respects determinism is a robust doctr...