Modern computing is generally taken to consist primarily of symbol manipulation. But symbols are abstract, and computers are physical. How can a physical device manipulate abstract symbols? Neither Church nor Turing considered this question. My answer is that the bit, as a hardware-implemented abstract data type, serves as a bridge between materiality and abstraction. Computing also relies on three other primitive—but more straightforward—abstractions: Sequentiality, State, and Transition. These physically-implemented abstractions define the borderline between hardware and software and between physicality and (...) abstraction. At a deeper level, asking how a physical device can interact with abstract symbols is the wrong question. The relationship between symbols and physical devices begins with the realization that human beings already know what it means to manipulate symbols. We build and program computers to do what we understand to be symbol manipulation. To understand what that means, consider a light switch. A light switch doesn’t turn a light on or off. Those are abstractions. Light switches don’t operate with abstractions. We build light switches, so that when flipped, the world is changed in such a way that we understand the light to be on or off. Similarly, we build computers to perform operations that we understand as manipulating symbols. (shrink)

We examine two very different approaches to formalising real computation, commonly referred to as “Computable Analysis” and “the BSS approach”. The main models of computation underlying these approaches—bit computation and BSS, respectively—have also been put forward as appropriate foundations for scientific computing. The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space. Since typically the problems dealt with in physical sciences, applied mathematics, economics, and engineering are also defined in (...) uncountable domains, it is fitting that we choose between these two approaches a foundational framework for scientific computing. However, the models are incompatible as to their results. What is more, the BSS model is highly idealised and unrealistic; yet, it is the de facto implicit model in various areas of computational mathematics, with virtually no problems for the everyday practice. This paper serves three purposes. First, we attempt to delineate what the goal of developing foundations for scientific computing exactly is. We distinguish between two very different interpretations of that goal, and on the separate basis of each one, we put forward answers about the appropriateness of each framework. Second, we provide an account of the fruitfulness and wide use of BSS, despite its unrealistic assumptions. Third, according to one of our proposed interpretations of the scope of foundations, the target domain of both models is a certain mathematical structure. In a clear sense, then, we are using idealised models to study a purely mathematical structure. The third purpose is to point out and explain this intriguing phenomenon and attempt to make connections with the typical case of idealised models of empirical domains. (shrink)

Computational Creativity, Concept Invention, and General Intelligence in their own right all are flourishing research disciplines producing surprising and captivating results that continuously influence and change our view on where the limits of intelligent machines lie, each day pushing the boundaries a bit further. By 2014, all three fields also have left their marks on everyday life – machine-composed music has been performed in concert halls, automated theorem provers are accepted tools in enterprises’ R&D departments, and cognitive architectures are being (...) integrated in pilot assistance systems for next generation airplanes. Still, although the corresponding aims and goals are clearly similar (as are the common methods and approaches), the developments in each of these areas have happened mostly individually within the respective community and without closer relationships to the goings-on in the other two disciplines. In order to overcome this gap and to provide a common platform for interaction and exchange between the different directions, the International Workshops on “Computational Creativity, Concept Invention, and General Intelligence” (C3GI) have been started. At ECAI-2012 and IJCAI-2013, the first and second edition of C3GI each gathered researchers from all three fields, presenting recent developments and results from their research and in dialogue and joint debates bridging the disciplinary boundaries. The chapters contained in this book are based on expanded versions of accepted contributions to the workshops and additional selected contributions by renowned researchers in the relevant fields. Individually, they give an account of the state-of-the-art in their respective area, discussing both, theoretical approaches as well as implemented systems. When taken together and looked at from an integrative perspective, the book in its totality offers a starting point for a (re)integration of Computational Creativity, Concept Invention, and General Intelligence, making visible common lines of work and theoretical underpinnings, and pointing at chances and opportunities arising from the interplay of the three fields. (shrink)

Computers have far to go to match human strengths, and our estimates will depend on analogy and extrapolation. Fortunately, these are grounded in the first bit of the journey, now behind us. Thirty years of computer vision reveals that 1 MIPS can extract simple features from real-time imagery--tracking a white line or a white spot on a mottled background. 10 MIPS can follow complex gray-scale patches--as smart bombs, cruise missiles and early self-driving vans attest. 100 MIPS can follow moderately unpredictable (...) features like roads--as recent long NAVLAB trips demonstrate. 1,000 MIPS will be adequate for coarse-grained three-dimensional spatial awareness--illustrated by several mid-resolution stereoscopic vision programs, including my own. 10,000 MIPS can find three-dimensional objects in clutter--suggested by several "bin-picking" and high-resolution stereo-vision demonstrations, which accomplish the task in an hour or so at 10 MIPS. The data fades there--research careers are too short, and computer memories too small, for significantly more elaborate experiments. (shrink)

Unlike Martin‐Löf randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and further, provides a general method for abstracting “bit‐wise” definitions of randomness from Cantor space to arbitrary computable probability spaces. This same method is also applied to give machine characterizations of computable and Schnorr randomness for computable probability spaces, extending the previously known results. The paper contains a (...) new type of randomness—endomorphism randomness—which the author hopes will shed light on the open question of whether Kolmogorov‐Loveland randomness is equivalent to Martin‐Löf randomness. The last section contains ideas for future research. (shrink)

In this paper we shed new light on the Argument from Disagreement by putting it to test in a computer simulation. According to this argument widespread and persistent disagreement on ethical issues indicates that our moral opinions are not influenced by any moral facts, either because no such facts exist or because they are epistemically inaccessible or inefficacious for some other reason. Our simulation shows that if our moral opinions were influenced at least a little bit by moral facts, we (...) would quickly have reached consensus, even if our moral opinions were affected by factors such as false authorities, external political shifts, and random processes. Therefore, since no such consensus has been reached, the simulation gives us increased reason to take seriously the Argument from Disagreement. Our conclusion is however not conclusive; the simulation also indicates what assumptions one has to make in order to reject the Argument from Disagreement. The simulation algorithm we use builds on the work of Hegselmann and Krause (J Artif Soc Social Simul 5(3); 2002, J Artif Soc Social Simul 9(3), 2006). (shrink)

1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers (...) of course to Alan Turing, famous for his explication of the notion of mechanical computation on discrete data such as the integers. The ‘Newton’ there has to do to with the well known numerical method due to Isaac Newton for approximating the zeros of continuous functions under suitable conditions that is taken to be a paradigm of scientific computing. Finally, the meaning of “Turing meets Newton” in the title of Blum’s article has another, more particular aspect: in connection with the problem of controlling errors in the numerical solution of linear equations and inversion of matrices,Turing (1948) defined a notion of condition for the relation of changes in the output of a computation due to small changes in the input that is analogous to Newton’s definition of the derivative. The thrust of Blum’s 2004 article was that the BSS model of computation on the reals is the appropriate foundation for scientific computing in general. By way of response, two years later another very interesting and equally readable article appeared in the Notices, this time by Mark Braverman and Stephen Cook (2006) entitled “Computing over the reals: Foundations for scientific computing,” in which the authors argued that the requisite foundation is provided by a quite different “bit computation” model, that is in fact prima facie incompatible with the BSS model. The bit computation model goes back to ideas due to Stefan Banach and Stanislaw Mazur in the latter part of the 1930s, but the first publication was not made until Mazur (1963).. (shrink)

A computer's task is often taken to be that of starting with some input, grinding for a while, and eventually returning an output. Remarkably, all such tasks can be accomplished "reversibly", with an arbitrarily low intrinsic entropy cost, and in reasonable space and time relative to irreversible approaches.

Brain-computer interface based on steady-state visual evoked potential has been widely studied due to the high information transfer rate, little user training, and wide subject applicability. However, there are also disadvantages such as visual discomfort and “BCI illiteracy.” To address these problems, this study proposes to use low-frequency stimulations, which can simultaneously elicit visual evoked potential and pupillary response to construct a hybrid BCI system. Classification accuracy was calculated using supervised and unsupervised methods, respectively, and the hybrid accuracy was obtained (...) using a decision fusion method to combine the information of VEP and PR. Online experimental results from 10 subjects showed that the averaged accuracy was 94.90 ± 2.34% for the supervised method and 91.88 ± 3.68% for the unsupervised method, which correspond to the ITR of 64.35 ± 3.07 bits/min and 33.19 ± 2.38 bpm, respectively. Notably, the hybrid method achieved higher accuracy and ITR than that of VEP and PR for most subjects, especially for the short data length. Together with the subjects’ feedback on user experience, these results indicate that the proposed h-BCI with the low-frequency stimulation paradigm is more comfortable and favorable than the traditional SSVEP-BCI paradigm using the alpha frequency range. (shrink)

Natural argument is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary natural arguments in any data. That ability of natural argument is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite (...) different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. -/- . (shrink)

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite (...) different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. (shrink)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

Surprise – these much-publicized rules are not the least bit reassuring to people who specialize in the study of ethics. While attention to ethics is certainly welcome, these ethical codes provide a too-easy cop-out, a way to neatly dispose of attention to nagging and pervasive problems. The typical professional code is little more than a checklist of rules that enables professionals of any stripe to give lip service to ethical behavior without engaging in continuing dialogue on ethical dilemmas. Neatly packaged (...) commandments short-circuit development of the reasoning tools to work through ethical challenges meaningfully and with long-lasting impact on the actual behavior in any field. (shrink)

James E. Huchingson's Pandemonium Tremendum draws on a surprisingly fruitful analogy between metaphysics and thermodynamics, with the latter motivated through the more accessible language of communication theory. In Huchingson's model, God nurtures creation by the selective communication of bits of order that arise spontaneously in chaos.

Replicability and reproducibility of computational models has been somewhat understudied by “the replication movement.” In this paper, we draw on methodological studies into the replicability of psychological experiments and on the mechanistic account of explanation to analyze the functions of model replications and model reproductions in computational neuroscience. We contend that model replicability, or independent researchers' ability to obtain the same output using original code and data, and model reproducibility, or independent researchers' ability to recreate a model without original code, (...) serve different functions and fail for different reasons. This means that measures designed to improve model replicability may not enhance (and, in some cases, may actually damage) model reproducibility. We claim that although both are undesirable, low model reproducibility poses more of a threat to long-term scientific progress than low model replicability. In our opinion, low model reproducibility stems mostly from authors' omitting to provide crucial information in scientific papers and we stress that sharing all computer code and data is not a solution. Reports of computational studies should remain selective and include all and only relevant bits of code. (shrink)

A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano arithmetics having a remarkable (...) symmetry to the axiom of choice. The quantity of information is interpreted as the number of elementary choices (bits). Quantum information is seen as the generalization of information to infinite sets or series. The equivalence of that model to a quantum computer is demonstrated. The condition for the Turing machines to be independent of each other is reduced to the state of Nash equilibrium between them. Two relative models of language as game in the sense of game theory and as ontology of metaphors (all mappings, which are not one-to-one, i.e. not representations of reality in a formal sense) are deduced. (shrink)

The paper presents an approach to encrypt the color images using bit-level permutation and alternate logistic map. The proposed method initially segregates the color image into red, green, and blue channels, transposes the segregated channels from the pixel-plane to bit-plane, and scrambles the bit-plane matrix using Arnold cat map (ACM). Finally, the red, blue, and green channels of the scrambled image are confused and diffused by applying alternate logistic map that uses a four-dimensional Lorenz system to generate a pseudorandom number (...) sequence for the three channels. The parameters of ACM are generated with the help of Logistic-Sine map and Logistic-Tent map. The intensity values of scrambled pixels are altered by Tent-Sine map. One-dimensional and two-dimensional logistic maps are used for alternate logistic map implementation. The performance and security parameters histogram, correlation distribution, correlation coefficient, entropy, number of pixel change rate, and unified averaged changed intensity are computed to show the potential of the proposed encryption technique. (shrink)

Landauer's principle, often regarded as the basic principle of the thermodynamics of information processing, holds that any logically irreversible manipulation of information, such as the erasure of a bit or the merging of two computation paths, must be accompanied by a corresponding entropy increase in non-information-bearing degrees of freedom of the information-processing apparatus or its environment. Conversely, it is generally accepted that any logically reversible transformation of information can in principle be accomplished by an appropriate physical mechanism operating in (...) a thermodynamically reversible fashion. These notions have sometimes been criticized either as being false, or as being trivial and obvious, and therefore unhelpful for purposes such as explaining why Maxwell's Demon cannot violate the second law of thermodynamics. Here I attempt to refute some of the arguments against Landauer's principle, while arguing that although in a sense it is indeed a straightforward consequence or restatement of the Second Law, it still has considerable pedagogic and explanatory power, especially in the context of other influential ideas in nineteenth and twentieth century physics. Similar arguments have been given by Jeffrey Bub. (shrink)

A generic computation of a subset $A$ of $\mathbb{N}$ consists of a computation that correctly computes most of the bits of $A$, and never incorrectly computes any bits of $A$, but which does not necessarily give an answer for every input. The motivation for this concept comes from group theory and complexity theory, but the purely recursion theoretic analysis proves to be interesting, and often counterintuitive. The primary result of this paper is that there are no minimal pairs (...) for generic computability, answering a question of Jockusch and Schupp. (shrink)

Since the emergence of computing as a mode of investigation in the sciences, computational approaches have revolutionised many fields of inquiry. Recently in philosophy, the question has begun rendering bit by bit—could computation be considered a deeper fundamental building block to all of reality? This paper proposes a continuum computing construct, predicated on a set of core computational principles: computability, discretisation, stability and optimisation. The construct is applied to the set of most fundamental physical laws, in the form of (...) non-relativistic conservation equations which underpin our governing physics. The discretisation approach divides all of space into a mesh of discrete computational cells, and evolution of data in those cells must obey pre-defined stability conditions from established continuum computing theory, namely, the Courant–Friedrichs–Lewy condition. Evolving cell-state data in a manner which logically optimises computational efficiency, combined with the defined stability condition, the construct derives a central coupling of space, time, and the fastest speed of information propagation. This coupling formed at the lowest level by the computing construct, naturally and inherently produces aspects of special relativity and general relativity at the macroscale. This paper therefore proposes a new explanation of why the nature of space and time may be fused, and explores simple emergent congruities with relativity. The theory invites us to reverse the philosophical premise of the original Simulation Argument. This argument currently leads us to consider: how might all of the observed physics of our reality be reproduced computationally in a simulation of our existence? This work asks instead: could foundations of the physics of our universe—namely spacetime coupling—emerge inherently, and necessarily, from fundamental principles of computation? (shrink)

العدل عنوانه الوحيد: الحرية. فلا عدالة منتظرة من وراء قيود الحديد أو الحرير، ولا ثمرة حقٍ يمكن أن نجنيها من تكميم الأفواه. ليس هناك أخطر على الأمم من غياب العدل وإهدار قيمة القانون وأحكام القضاء. لكن السلطة لا تدري.. ولا تتعلم. فالسلطة، أو الولاية، "هي إنفاذ القول على الغير"؛ لذا سمعنا في التاريخ عن مصطلح "الأحكام السلطانية" التي قد لا تتفق بالضرورة مع مبادئ الحقوق والحريات ورد المظالم. تبحث السلطة التنفيذية عادةً عن رخصة استبداد، أو بنية تحتية للتسلط والوصاية. والضحية (...) الأولى لهذا المسعى هي العدالة، التي تمثلها السلطة القضائية. ليس صدفة، إذًا، أن يحظى القضاء بمكانة خاصة في الأنظمة الديمقراطية، وليس غريبـًا أن يكون في وضع استصغار في البلاد التي تعذر عليها استنبات الديمقراطية في مؤسساتها. وبقدر وجود ضمانات سياسية ودستورية ومؤسسية وثقافية تحفظ للقضاء استقلاله ونزاهته وقدرته على أداء مهامه بعيدًا عن مصادر الضغط والتدخل، بقدر ما تكون هذه الدولة أو تلك ديمقراطية. (shrink)

Islamic sermons, Arabic; Islamic ethics.

The problem of initializing phase in a quantum computing system is considered. The initialization of phases is a problem when the system is initially present in a superposition state as well as in the application of the quantum gate transformations, since each gate will introduce phase uncertainty. The accumulation of these random phases will reduce the effectiveness of the recently proposed quantum computing schemes. The paper also presents general observations on the nonlocal nature of quantum errors and the expected performance (...) of the recently proposed quantum error-correction codes that are based on the assumption that the errors are either bit-flip or phase-flip or both. It is argued that these codes cannot directly solve the initialization problem of quantum computing. (shrink)

Basic Digital Education is already planned to be integrated with the forthcoming curriculum for Austrian primary schools as it was already implemented for lower secondary schools in 2018. BDE includes the most essential and novel developments of Computational Thinking, which are fundamentally responsible for nurturing students' problem-solving skills. Thus, evaluating teaching materials, scaffolding guidelines, and assessments is becoming increasingly important for the successful implementation of CT in Austrian classrooms. This study is a part of a longitudinal multi-cycle educational design research (...) project aiming to explore how to foster CT and to raise the awareness, importance, and confidence of teachers and students in applying CT for everyday uses. Our paper focuses on a sub-study in which teaching units for grade 3 and 4 students were designed by combining an Open Educational Resource textbook and Physical Computing with the micro:bit device. The designed learning environment consists of three units and was implemented in two classes over 3 weeks. The two classes were further split into two groups each, to ensure better support during implementation. The class teachers received upfront teacher training and conducted pre- and post-test assessments with the students. The resulting data was then analyzed to gain insights into the effects on CT skills of the young learners. Results showed that combining block-based programming and physical computing devices could become a promising approach to promote computational thinking skills in lower school grades. Furthermore, the observed direction of the designed units supports low-barrier access to increase the desired uses of CT in classrooms. (shrink)

The explosion of data grows at a rate of roughly five trillion bits a second, giving rise to greater urgency in conceptualizing the infosphere and understanding its implications for knowledge and public policy. Philosophers of technology and information technologists alike who wrestle with ontological and epistemological questions of digital information tend to emphasize, as Floridi does, information as our new ecosystem and human beings as interconnected informational organisms, inforgs at home in ambient intelligence. But the linguistic and conceptual representations of (...) Big Data—the massive volume of both structured and unstructured data—and the real world practice of data-mining for patterns and meaningful interpretation of evidence reveal tension and ambiguity in the bold promise of data analytics. This paper explores the tacit epistemology of the rhetoric and representation of Big Data and suggests a richer account of its ambiguities and the paradox of its real world materiality. We argue that Big Data should be recognized as manifesting multiple and conflicting trajectories that reflect human intentionality and particular patterns of power and authority. Such patterns require attentive exploration and moral appraisal if we are to resist simplistic informationist ontologies of Big Data, and the subtle forms of control in the political ecology of Big Data that undermine its promise as transformational knowledge. (shrink)

One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[n] : n ∈ ω) approximating α and (b[n] : n ∈ ω) approximating β and a positive constant C such that for all n, C(α − a[n]) ≥ (β − b[n]). See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin’s Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. (...) Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. We show that every recursively enumerable random real dominates all other recursively enumerable reals. We conclude that the recursively enumerable random reals are exactly the Ω-numbers [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. Second, we show that the sets in a universal Martin-Lof test for randomness have random measure, and every recursively enumerable random number is the sum of the measures represented in a universal Martin-Lof test. (shrink)

Since its conception nearly 20 years ago, Logic Programming - the idea of using logic as a programming language - has been developed to the point where it now plays an important role in areas such as database theory, artificial intelligence and software engineering. However, there are still many challenging research issues to be addressed and the UK branch of the Association for Logic Programming was set up to provide a forum where the flourishing research community could discuss important issues (...) of Logic Programming which were often by-passed at the large international conferences. This volume contains the twelve papers which were presented at the ALPUK's 3rd conference which was held in Edinburgh, 10-12 April 1991. The aim of the conference was to give a broad but detailed technical insight into the work currently being done in this field, both in the UK and by researchers as far afield as Canada and Bulgaria. The breadth of interest in this area of Computer Science is reflected in the range of the papers which cover - amongst other areas - massively parallel implementation, constraint logic programming, circuit modelling, algebraic proof of program properties, deductive databases, specialised editors and standardisation. The resulting volume gives a good overview of the current progress being made in the field and will be of interest to researchers and students of any aspects of logic programming, parallel computing or database techniques and management. (shrink)

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state (...) of the art in the area. (shrink)

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...) implement the idea of "infinite calculation" is the main subject. (shrink)

Legal information certification and secured storage combined with documents electronic signature are of great interest when digital documents security and conservation are in concern. Therefore, these new and evolving technologies offer powerful abilities, such as identification, authentication and certification. The latter contribute to increase the global security of legal digital archives conservation and access. However, currently used cryptographic and hash coding concepts cannot intrinsically enclose cognitive information about both the signer and the signed content. Indeed, an evolution of these technologies (...) may be necessary to achieve full text researches within hundreds or thousands of electronically signed documents. This article aims at describing a possible model along with associated processes to create and make use of these new electronic signatures called “meaningful electronic signatures” as opposed to traditional electronic signatures based on bit per bit computation. (shrink)

Building computational models of engineered exemplars, or prototypes, is a common practice in the bioengineering sciences. Computational models in this domain are often built in a patchwork fashion, drawing on data and bits of theory from many different domains, and in tandem with actual physical models, as the key objective is to engineer these prototypes of natural phenomena. Interestingly, such patchy model building, often combined with visualizations, whose format is open to a wide range of choice, leads to the discovery (...) of new concepts and control structures. Two key questions are raised by this practice: how could discoveries arise from building external representations for which there is wide latitude in choice of the components from which they are built, and thus can be considered significantly arbitrary, and how could such discoveries allow engineering a real-world prototype system. To examine these questions, we present two case studies of discoveries that emerged from the building of such computational models in the bioengineering sciences. We then develop a process model that accounts for the discovery and transfer problems raised by both these cases, focusing on the process of building the model. Specifically, to account for the discovery problem, we propose that the process of building such models gradually leads to a close coupling between the modeler’s internal processes and the external dynamic model. To account for the transfer problem, we propose that the process of building the model leads to the creation of an enactive model that is generic, which closely enacts, and thus reveals, the way the system-level behavior of the engineered prototype emerges in time through the interaction of its parts. This enactive replication process leads to the model and the prototype forming a new class, which allows concepts and control structures developed for the computational model to be transfered to the real-world prototype. We argue that this account requires rethinking correspondence in engineering sciences as a plastic and enactive relation. A closer focus on the process of building models is required to develop a general account of this emerging approach to discovery. (shrink)

Augmented reality-based brain–computer interface (AR–BCI) has a low signal-to-noise ratio (SNR) and high real-time requirements. Classical machine learning algorithms that improve the recognition accuracy through multiple averaging significantly affect the information transfer rate (ITR) of the AR–SSVEP system. In this study, a fast recognition method based on a separable convolutional neural network (SepCNN) was developed for an AR-based P300 component (AR–P300). SepCNN achieved single extraction of AR–P300 features and improved the recognition speed. A nine-target AR–P300 single-stimulus paradigm was designed to (...) be administered with AR holographic glasses to verify the effectiveness of SepCNN. Compared with four classical algorithms, SepCNN significantly improved the average target recognition accuracy (81.1%) and information transmission rate (57.90 bits/min) of AR–P300 single extraction. SepCNN with single extraction also attained better results than classical algorithms with multiple averaging. (shrink)