The Random Number Generation task has a long history in neuropsychology as an assessment procedure for executive functioning. In recent years, understanding of human behavior has gradually changed from reflecting a static to a dynamic process and this shift in thinking about behavior gives a new angle to interpret test results. However, this shift also asks for different methods to process random number sequences. The RNG task is suited for applying non-linear methods needed to uncover (...) the underlying dynamics of random number generation. In the current article we present RandseqR: an R-package that combines the calculation of classic randomization measures and Recurrence Quantification Analysis. RandseqR is an easy to use, flexible and fast way to process random number sequences and readies the RNG task for current scientific and clinical use. (shrink)

Many experiments have been conducted over the past eight decades to explore whether the ostensible psychic ability of psychokinesis (PK, or "mind over matter") might be a genuine human potential, and the most extensive of these have involved attempts to mentally influence the output of electronic, binary-bit random number generators (RNGs). Research of this type can generally be divided into two lines: proof-oriented (concerned with the accumulation and statistical evaluation of data from controlled experiments designed specifically to test (...) for the presence of PK effects on the microscopic scale) and process-oriented (concerned with conducting exploratory experiments designed to systematically vary certain test conditions in order to search for and identify any physical, biological, and psychological factors which might have a role in improving or moderating PK effects). To help orient novice investigators and cross-disciplinary researchers who may be considering work along these lines (as well as offer some initial guiding insight on possible directions for future research), this paper provides a general review of some of the notable proof- and process-oriented findings that have been obtained to date in experimental microscopic PK research using RNGs. The review generally indicates that although a considerable amount of proof-oriented data for micro-PK has accumulated over the years, the relatively sparse amount of process-oriented data available at present leaves a lot of open questions regarding the underlying factors involved, providing ample opportunity for novice investigators and cross-disciplinary researchers to make valuable research contributions in the future. (shrink)

In this paper, we propose a method to design the pseudorandom number generator using three kinds of four-wing memristive hyperchaotic systems with different dimensions as multientropy sources. The principle of this method is to obtain pseudorandom numbers with good randomness by coupling XOR operation on the three kinds of FWMHSs with different dimensions. In order to prove its potential application in secure communication, the security of PRNG based on this scheme is analyzed from the perspective of cryptography. In addition, (...) PRNG has passed the NIST 800.22 and ENT test, which shows that PRNG has good statistical characteristics. Finally, an image encryption algorithm based on PRNG is adopted. In the encryption algorithm, the optimized Arnold matrix scrambling method and the diffusion processing based on XOR are used to obtain the final encrypted image. Through the evaluation of encryption performance, it is concluded that there is no direct relationship between the pristine image and encrypted image. The results show that the proposed image encryption scheme has good statistical output characteristics and security performance in line with cryptography. (shrink)

We consider tautologies formed form a pseudo-random number generator, defined in Krajicek [11] and in Alekhnovich et al. [2]. We explain a strategy of proving their hardness for Extended Frege systems via a conjecture about bounded arithmetic formulated in Krajicek [11]. Further we give a purely finitary statement, in the form of a hardness condition imposed on a function, equivalent to the conjecture. This is accompanied by a brief explanation, aimed at non-specialists, of the relation between prepositional proof (...) complexity and bounded arithmetic. (shrink)

Charles Darwin's Origin of Species, published in 1859, was a revolutionary attempt “to overthrow the dogma of separate creations,” a declaration that provoked different reactions among the religious, ranging from mild enthusiasm to anger. Christians sympathetic to Darwin's effort sought to make Darwinism appear compatible with their religious beliefs. Two of Darwin's most prominent defenders in the United States were the Calvinists Asa Gray, a Harvard botanist, and George Frederick Wright, a cleric-geologist. Gray, who long favored a “special origination” in (...) connection with the evolution of humans and questioned whether natural selection can account for the formation of organs, the making of eyes, etc., embraced natural selection as the primary mechanism underlying the production of most species. He also went so far as to invoke divine providence, rather than randomness, to explain the variations on which natural selection acted. This chapter discusses creationism, intelligent design, and modern biology. (shrink)

Many psychological studies have shown that human‐generated sequences are hardly ever random in the strict mathematical sense. However, what remains an open question is the degree to which this (in)ability varies between people and is affected by contextual factors. Herein, we investigated this problem. In two studies, we used a modern, robust measure of randomness based on algorithmic information theory to assess human‐generated series. In Study 1 (), in a factorial design with task description as a between‐subjects variable, we (...) tested the effects of context and mental fatigue on human‐generated randomness. In Study 2 (), in online research, in experimental design, we further investigated the effect of mental fatigue on the randomness of human‐generated series and the relationship between the need for cognition (NFC) and the ability to produce random‐like series. Results of Study 1 show that the activation of the ability to produce random‐like series depends on the relevance of the contextual cues (), whether they activate known representations of a random series generator and consequently help to avoid the production of trivial sequences. Our findings from both studies on the effect of mental fatigue (Study 1 – ; Study 2 – ) and cognitive motivation () demonstrate that regardless of the context or task's novelty people quickly lose interest in the random series generation. Therefore, their performance decreases over time. However, people high in the NFC can maintain the cognitive motivation for a longer period and consequently on average generate more random series. In general, our results suggest that when contextual cues and intrinsic constraints are in optimal interaction people can temporarily escape the structured and trivial patterns and produce more random‐like sequences. (shrink)

“Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin.”1 John von Neumann’s famous dictum points an accusing finger at all who set their ordered minds to engender disorder. Much as in times past thieves, pimps, and actors carried on their profession with an uneasy conscience, so in this day scientists who devise random number generators suffer pangs of guilt. George Marsaglia, perhaps the preeminent worker in the field, quips when (...) he asks his colleagues, “Who among us has not sinned?” Marsaglia’s work at the Supercomputer Computations Research Institute at Florida State University is well-known. Inasmuch as Marsaglia’s design and testing of random number generators depends on computation, and inasmuch as computation is fundamentally arithmetical, Marsaglia is by von Neumann’s own account a sinner. Working as he does on a supercomputer, Marsaglia is in fact a gross sinner. This he freely admits. Writing of the best random number generators he is aware of, Marsaglia states, “they are the result of arithmetic methods and those using them must, as all sinners must, face Redemption [sic] Day. But perhaps with better understanding we can postpone it.”. (shrink)

The book is intended to explain the larger and intuitive concept of randomness by means of computation, particularly through algorithmic complexity and recursion theory. It also includes the transcriptions (by A. German) of two panel discussion on the topics: Is The Universe Random?, held at the University of Vermont in 2007; and What is Computation? (How) Does Nature Compute?, held at the University of Indiana Bloomington in 2008. The book is intended to the general public, undergraduate and graduate students (...) in math, computer science, physics and other sciences, but also to philosophers of science and researchers. (shrink)

This paper presents a novel improved firefly algorithm (IFA) to deal the problem of the optimal operation of thermal generating units (OOTGU) with the purpose of reducing the total electricity generation fuel cost. The proposed IFA is developed based on combining three improvements. The first is to be based on the radius between two solutions, the second is updated step size for each considered solution based on different new equations, and the third is to slightly modify a formula producing (...) new solutions by using normally distributed random numbers and canceling uniform random numbers of conventional firefly algorithm (FA). The effect of each proposed improvement on IFA is investigated by executing five benchmark functions and two different systems. The performance of IFA is investigated on six other study cases consisting of different types of objective function and complex level of constraints. The objective function considers single fuel with quadratic form and nonconvex form, and multifuels with the sum of several quadratic and nonconvex functions while a set of constraints taken into account are power loss, prohibited zone, ramp rate limit, spinning reserve, and all constraints in transmission power networks. The obtained results indicate the proposed improvements in terms of high optimal solution quality, stabilization of search ability, and fast convergence compared with FA. In addition, the comparisons with other methods also lead to a conclusion that the proposed method is a very promising optimization tool for systems with quadratic fuel cost function and with complicated constraints. (shrink)

Examinations form part of the assessment processes that constitute the basis for benchmarking individual educational progress, and must consequently fulfill credibility, reliability, and transparency standards in order to promote learning outcomes and ensure academic integrity. A randomly selected question examination is considered to be an effective solution to mitigate sharing of questions between students by addressing replicated inter-examination questions that compromise examination integrity and sequential intra- examination questions that compromise examination comprehensivity. In this study, a Monte Carlo approach was used (...) to design six examination schemes for the purpose of generating and evaluating 600 RSQEs in order to investigate the effects of RSQE design on replicated inter-examination and sequential and intra-examination questions. Results revealed that the number of randomly selected questions from the pool and the number of sub-pools inversely affected the replication and sequencing of the examination questions. Thus, by designing the RSQE in many sub-pools, in equivalence to the number of examination questions and selecting only one question from each sub-pool, and updating the sub-pools after each examination, the passing of information can be prevented, ensuring the integrity of the examinations. (shrink)

In this paper, we analyze the effect of the speed on the task of random number generation. Each subjectgenerates the sequences of ``random'' numbers under various speed conditions. In addition to the 16 indiceswhich have been used in the past studies, we introduce and calculate the new indices called the ``frequency ofschema''. From the statistical analysis, we find that there is an obvious change, along with the speed, in theproperties of sequences, indicating the transition of the (...) underling information processing. It is shown that thefrequencies of schemas are effective indices for describing the properties of sequences produced under high-speed conditions. (shrink)

We study the sets that are computable from both halves of some (Martin–Löf) random sequence, which we call 1/2-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the K-trivial sets. We characterize 1/2-bases as the sets computable from both halves of Chaitin’s Ω, and as the sets that obey the cost function c(x,s)=Ωs−Ωx−−−−−−−√. Generalizing these results yields a dense hierarchy (...) of subideals in the K-trivial degrees: For k<n, let Bk/n be the collection of sets that are below any k out of n columns of some random sequence. As before, this is an ideal generated by its c.e. elements and the random sequence in the definition can always be taken to be Ω. Furthermore, the corresponding cost function characterization reveals that Bk/n is independent of the particular representation of the rational k/n, and that Bp is properly contained in Bq for rational numbers p<q. These results are proved using a generalization of the Loomis–Whitney inequality, which bounds the measure of an open set in terms of the measures of its projections. The generality allows us to analyze arbitrary families of orthogonal projections. As it turns out, these do not give us new subideals of the K-trivial sets; we can calculate from the family which Bp it characterizes. We finish by studying the union of Bp for p<1; we prove that this ideal consists of the sets that are robustly computable from some random sequence. This class was previously studied by Hirschfeldt [D. R. Hirschfeldt, C. G. Jockusch, R. Kuyper and P. E. Schupp, Coarse reducibility and algorithmic randomness, J. Symbolic Logic81(3) (2016) 1028–1046], who showed that it is a proper subclass of the K-trivial sets. We prove that all such sets are robustly computable from Ω, and that they form a proper subideal of the sets computable from every (weakly) LR-hard random sequence. We also show that the ideal cannot be characterized by a cost function, giving the first such example of a Σ03 subideal of the K-trivial sets. (shrink)

The concept of randomness as applied to number sequences is important to the study of the relationship between the foundations of mathematics and physics. A reason is that while randomness is often defined in mathematical-logical terms, the only way one has to generate random number sequences is by means of repetitive physical processes. This paper will examine the question: What definition of randomness is correct in the sense of being the weakest allowable? Why this question is so (...) important will become clear during the course of the discussion.The main body of this paper is divided into three sections. Section 1. discusses the use of probability theory to describe various statistical processes and some of the alternative definitions of randomness that have been proposed.In Section 2. a criterion which a definition of randomness should satisfy is proposed. (shrink)

The study of the chaotic dynamics in fractional-order discrete-time systems has received great attention over the last years. Some efforts have been also devoted to analyze fractional maps with special features. This paper makes a contribution to the topic by introducing a new fractional map that is characterized by both particular dynamic behaviors and specific properties related to the system equilibria. In particular, the conceived one dimensional map is algebraically simpler than all the proposed fractional maps in the literature. Using (...) numerical simulation, we investigate the dynamic and complexity of the fractional map. The results indicate that the new one-dimensional fractional map displays various types of coexisting attractors. The approximate entropy is used to observe the changes in the sequence sequence complexity when the fractional order and system parameter. Finally, the fractional map is applied to the problem of encrypting electrophysiological signals. For the encryption process, random numbers were generated using the values of the fractional map. Some statistical tests are given to show the performance of the encryption. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (shrink)

many symbols. We define o, as the probability that an arbitrary machine be circular and we prove that o, is a random number that goes beyond..

Progress may be made in resolving the tension between free will and determinism by analysis of the necessary conditions of freedom. It is of the essence that these conditions include causal and deterministic regularities. Furthermore, the human expression of free will is informed by understanding some of those regularities, and increments in that understanding have served to enhance freedom. When the possible character of a deterministic system based on physical theory is considered, it is judged that, far from implying the (...) elimination of human freedom, such a theory might simply set parameters for it; indeed knowledge of that system could again prove to be in some respects liberating. On the other hand, it is of the essence that the overarching biological framework is not a deterministic system and it foregrounds the behavioural flexibility of humans in being able to choose within a range of options and react to chance occurrences. Furthermore, an issue for determinism flows from the way in which randomness (e.g. using a true random number generator) and chance events could and do enter human life. Once the implications of that issue are fully understood, other elements fit comfortably together in our understanding of freely undertaken action: the contribution of reasons and causes; the fact that reasons are never sufficient to account for outcomes; the rationale for the attribution of praise and blame. (shrink)

In light of the interrelation between motor and cognitive development and the predictive value of the former for the latter, the secular decline observed in motor coordination ability as early as preschool urges identification of interventions that may jointly impact motor and cognitive efficiency. The aim of this study was twofold. It (1) explored the outcomes of enriched physical education, centered on deliberate play and cognitively challenging variability of practice, on motor coordination and cognitive processing; (2) examined whether motor coordination (...) outcomes mediate intervention effects on children’s cognition, while controlling for moderation by lifestyle factors as outdoor play habits and weight status. Four hundred and sixty children aged 5-10 years participated in a 6-month group randomized intervention in physical education, with or without playful coordinative and cognitive enrichment. The weight status and spontaneous outdoor play habits of children (parental report of outdoor play) were evaluated at baseline. Before and after the intervention, motor developmental level (Movement Assessment Battery for Children) was evaluated in all children, who were then assessed either with a test of working memory (Random Number Generation task), or with a test of attention (from the Cognitive Assessment System, CAS). Children assigned to the ‘enriched’ intervention showed more pronounced improvements in all motor coordination assessments (manual dexterity, ball skills, static/dynamic balance). The beneficial effect on ball skills was amplified by the level of spontaneous outdoor play and weight status. Among indices of executive function and attention, only that of inhibition showed a differential effect of intervention type. Moderated mediation showed that the better outcome of the enriched physical education on ball skills mediated the better inhibition outcome, but only when the enrichment intervention was paralleled by a medium-to-high level of outdoor play. Results suggest that specifically tailored physical activity games provide a unique form of enrichment that impacts children’s cognitive development through motor coordination improvement, particularly object control skills, which are linked to children’s physical activity habits later in life. Outdoor play appears to offer the natural ground for the stimulation by designed physical activity games to take root in children’s mind. (shrink)

Gödel's Theorem is often used in arguments against machine intelligence, suggesting humans are not bound by the rules of any formal system. However, Gödelian arguments can be used to support AI, provided we extend our notion of computation to include devices incorporating random number generators. A complete description scheme can be given for integer functions, by which nonalgorithmic functions are shown to be partly random. Not being restricted to algorithms can be accounted for by the availability of (...) an arbitrary random function. Humans, then, might not be rule-bound, but Gödelian arguments also suggest how the relevant sort of nonalgorithmicity may be trivially made available to machines. (shrink)

In an effort to further explore ostensible macroscopic psychokinesis (macro-PK) effects like those previously reported by Batcheldor (1966), Bourgeois (1994), Owen and Sparrow (1976), and Ullman (2001) in a sitter group setting, the first author designed and conducted a series of fifteen experimental sessions in which sitters claiming exceptional abilities attempted to generate a pseudo-spirit named "Daniel," to whom physical phenomena were attributed. To explore possible physical correlates of macro-PK, two approaches to measurement were utilized. In the first, sample data (...) from a local random number generator (RNG) continuously running as part of the Global Consciousness Project were extracted and examined for statistical deviations from randomness occurring in conjunction with the sitter group sessions. In the second, the Multi-Energy Sensor Array (MESA) was used to collect onsite environmental data during one of the sessions. While displays of ostensible macro-PK were observed during several of the sitter group sessions, the RNG data did not show a significant overall correlation with the sessions. The MESA data indicated notable drops in infrared and visual light, as well as changes in DC magnetic field strength, that are comparable to those observed in field studies of haunts. Keywords: sitter groups--macroscopic psychokinesis (macro-PK)--random number generator (RNG)--Multi-Energy Sensor Array (MESA). (shrink)

In the new physics and in the new field of cosmometry, 1 it is the fundamental pattern that results in the motion from which all is created. Everything starts with the point of infinite potential. The tetrahedron at the point gives birth to the cuboctahedron ; its motion and structure result in the creation of the torus structure. The torus structure is self-referencing on a moment by moment basis since all must pass through the center. But isn't self-referencing the basis (...) for consciousness? It is said that all of creation has awareness, but at different levels. We know plants are aware of threats and of death to other living creatures by the work of Cleve Backster. We know we influence random number generators from the PEAR studies at Princeton. We know baby chicks will influence the movement of robots programed to do a random walk from the work of Rene Peoc'h. Quantum physics has embraced geometry with the work in the equations which explain the Feynman diagrams where particles come in and out of existence; those equations form a structure called the Amplituhedron - which is a quarter of a star tetrahedron. We also know that the tetrahedron can form the star tetrahedron and that each point of the star tetrahedron can form its own star tetrahedron, which can go on infinitely. That is, there is infinity in the finite. As in the fractal and holographic universe, each point or tetrahedron is connected to every other point. If each point has awareness due to formation of the torus, then Hermes teaching of "As above, as below" has meaning in the torus structure. If the torus is the fundamental unit of self-reference, is that the fundamental unit from which consciousness arises? The torus or double torus appears to be fundamental to all of creation - from galaxies to planets to atoms to photons. (shrink)

Digital computers are by design completely deterministic, yet they are often consumers of randomness in cryptography, simulations, science experiments and computer games. To generate randomness in software, programmers implement special mathematical algorithms, which produce a series of numbers that appear nondeterministic, so called pseudo random number generators (PRNGs). Computer games make heavy use of such PRNGs to make game simulations and behaviors of game elements appear more natural. An important design element of many video games is game physics, (...) the simulation of physical reality in video games. Generally overlooked by game developers, is the fact that randomness based on PRNGs are mere simulations themselves and randomness is not treated as a physical property of reality, and thus a form of game physics. Since the dynamics of the very small and the very complex invariably contains randomness, the author suggests this can be used to extend to the scope of game physics by defining two new game physics elements: 1. providing physics based random data to games or interactive media and 2. extracting true randomness from game-player interactions themselves. (shrink)

ISSUE DESCRIPTION The The Journal of Scientific Exploration is devoted to the open-minded examination of scientific anomalies and other topics on the scientific frontier. Its articles and reviews, written by authorities in their respective fields, cover both data and theory in areas of science that are too often ignored or treated superficially by other scientific publications. This issue of the journal features papers on a variety of subjects. The lead article presents the results of an innovative ball-selection test for ESP, (...) including a successful replication under tighter and presumably more repressive conditions under skeptical supervision at the University of London. The next paper presents a double-blind study of apparent short-term precognition in Bengalese finches. The test tracked whether the birds displayed alarm behavior prior to the random display of a crawling snake video. The third paper discusses an original approach to the study of ostensible macroscopic psychokinetic phenomena produced in a mediumistic sitter-group setting. The participants tried to generate a pseudo-spirit similar to that in the famous Philip experiments, and the researchers deployed various strategies for detecting and measuring physical correlates of the phenomena observed during the sessions. The fourth paper reports an attempt to use random number generators to detect field consciousness while people watched a film in a movie theater. In the fifth paper, researchers report a study that used advanced signal-processing techniques and instantaneous EEG phase coupling to examine interpersonal connectivity between healer and subject. The final paper presents two studies designed to illustrate how laboratory ESP effects might be used to predict real-world, practical events--in this case, the behavior of sets of financial indices. This issue of the JSE is then filled out, as usual, with a large selection of substantive book reviews. (shrink)

This is a particularly rich issue of the JSE. And a hefty one. Its size is due primarily to two quite lengthy essays, one by Bryan Williams and one by Michael Sudduth. Of course, all of this issue’s articles and reviews are worth reading; that’s why we’re publishing them. But these two huge essays merit a few extra comments. Bryan Williams has given us something that I and various SSE members have hoped for over the years, a detailed review of (...) a specific line of anomalistic research—the kind of article that would be useful to both veterans and newcomers to edge science. I’ve often tried to recruit such an opus from SSE colleagues at our conferences, hoping my considerable charm would dazzle them into accepting the opportunity. I’ve even been assured on several occasions that the solicited reviews would be forthcoming. But only Bryan, so far, has delivered the goods, a splendid essay surveying research on PK with random number generators. Not surprisingly, this review took Bryan a long time to write, and I want to thank him, not only for the result, but for his tenacity. Michael Sudduth’s essay is a forensic tour de force (as befits an admirer of the TV detective show Columbo)—an unprecedently detailed critique of the James Leininger case of ostensible reincarnation. That case is both complicated and messy, and it illustrates a general problem with CORT investigations that I’ve dubbed the Problem of Investigative Intricacy. (shrink)

How to estimate the randomness in random sequence generation tasks? The aim of the paper was to discuss the accuracy of the multiple indexes used for random sequences generation results calculation. In the first part of the paper the models explaining deviations from randomness were presented. The key role of the structural limitations interpretation was suggested. Secondly, the multiple indexes of the deviation from randomness used in random sequence generation task studies were presented. The (...) authors concluded that too many indexes are used in the studies of deviation from randomness. In order to avoid such problems two indexes were proposed: entropy and correlation function. The last part of the paper presents the preliminary version of the mathematical of random sequences generation in which the limited capacity of the short-term memory assumption was introduce. (shrink)

Watermarking is one of the most common techniques used to protect data’s authenticity, integrity, and security. The obfuscation in the frequency domain used in the watermarking method makes the watermarking stronger than the obfuscation in the spatial domain. It occupies an important place in watermarking works in imperceptibility, capacity, and robustness. Finding the optimal location to hide the watermarking is one of the most challenging tasks in these methods and affects the method’s performance. In this article, sample identification information is (...) processed with the method of watermaking on the hiding environment created by using a chaos-based random number generator on biomedical data to provide solutions to problems such as visual attack, identity theft, and information confusion. In order to obtain biomedical data, a lensless digital in-line holographic microscopy setup was designed, and holographic data of human blood and cancer cell lines, which are widely used in the laboratory environment, were obtained. The standard USAF 1951 target was used to evaluate the resolution of our imaging setup. Various QR codes were generated for medical sample identification, and the captured medical data were processed by watermarking it with chaos-based random number generators. A new method using chaos-based discrete wavelet transform and singular value decomposition has been developed and applied to high-resolution data to eliminate the problem of encrypted data being directly targeted by third-party attacks. The performance of the proposed new watermarking method has been demonstrated by various robustness and invisibility tests. Experimental results showed that the proposed scheme reached an average PSNR value of 564588 dB and SSIM value of 0.9972 against several geometric and destructive attacks, which means that the proposed method does not affect the image quality and also ensures the security of the watermarking information. The results of the proposed method have shown that it can be used efficiently in various fields. (shrink)

We show that within the class of ontological models due to Harrigan and Spekkens, those satisfying preparation-measurement reciprocity must allow indeterminism comparable to that in quantum theory. Our result implies that one can design quantum random number generator, for which it is impossible, even in principle, to construct a reciprocal deterministic model.

Approaches to foster motor creativity differ according to whether creative movements are assumed to be enacted creative ideas, or solutions to emerging motor problems that arise from task and environmental constraints. The twofold aim of the current study was to investigate whether an enriched physical education intervention delivered with a joint constraints-led and cognitive stimulation approach fosters motor creativity, and the responsiveness to the intervention is moderated by baseline motor and cognitive skills and sex; the intervention may benefit motor creativity (...) through gains in motor coordination, executive function, and creative thinking. Ninety-five children, aged 6–9 years, participated in a 6-month group randomized trial with specialist-led enriched PE vs. generalist-led conventional PE. Before and after the intervention, Bertsch’s Test of Motor Creativity, Movement Assessment Battery for Children, Random Number Generation task and Torrance Test of Creative Thinking were administered. Linear mixed models were run accounting for the random effects of data clusters. Multiple mediation analysis was performed to assess whether motor coordination, executive function and creative thinking mediated any improvement of motor creativity. Results showed that specialist-led enriched PE, compared to generalist-led conventional practice, elicited a more pronounced improvement in all motor creativity dimensions independently of baseline levels of motor and cognitive skills and sex; and improved motor creativity was partially mediated by improved motor coordination and, as regards motor flexibility, also by improved inhibitory ability. In conclusion, enriching PE with tailored manipulations of constraints and variability may enhance the ability to create multiple and original task-pertinent movements both directly and through indirect paths. The results are discussed extending to motor creativity a theoretical framework that distinguishes different creativity modes. The intervention may have fostered the generation of creative movements directly through the exposure to variation in constraints, activating the sensorimotor ‘flow’ mode of creativity that bypasses higher-order cognition, but also indirectly through a systematic and conscious convergence on solutions, activating the ‘deliberate’ mode of creativity that relies on inhibition to reject common or task-inappropriate movement categories. (shrink)

Computers have transformed science and help to extend the boundaries of human knowledge. However, does the validation and diffusion of results of computational inquiries and computer simulations call for a novel epistemological analysis? I discuss how the notion of novelty should be cashed out to investigate this issue meaningfully and argue that a consequentialist framework similar to the one used by Goldman to develop social epistemologySocial epistemology can be helpful at this point. I highlight computational, mathematical, representational, and social stages (...) on which the validity of simulation-based belief-generating processes hinges, and emphasize that their epistemic impact depends on the scientific practices that scientists adopt at these different stages. I further argue that epistemologists cannot ignore these partially novel issues and conclude that the epistemology of computational inquiries needs to go beyond that of models and scientific representations and has cognitive, social, and in the present case computational, dimensions. (shrink)

We consider random processes more general than those considered by Erdös and Rényi for generating the countable random graph. It is proved that, in the category sense, almost all random processes we consider generate the countable random graph with probability 1. Under a weak boundedness assumption we give a criterion for the random processes which generate the countable random graph almost surely. We also consider further questions asked by Jackson regarding the outcome graphs when (...) the process fails to produce the countable random graph. (shrink)