scholarly journals Computational Completeness of Interaction Machines and Turing Machines

10.29007/39jj ◽  
2018 ◽  
Author(s):  
Peter Wegner ◽  
Eugene Eberbach ◽  
Mark Burgin
Keyword(s):  
Computer Science ◽  
Complete Theory ◽  
Simple Computation ◽  
Turing Machines ◽  
Complete Model ◽  
Models Of Computation ◽  
Computational Completeness ◽  
Definition Of

In the paper we prove in a new and simple way that Interactionmachines are more powerful than Turing machines. To do thatwe extend the definition of Interaction machines to multiple interactivecomponents, where each component may perform simple computation.The emerging expressiveness is due to the power of interaction and allowsto accept languages not accepted by Turing machines. The mainresult that Interaction machines can accept arbitrary languages over agiven alphabet sheds a new light to the power of interaction. Despite ofthat we do not claim that Interaction machines are complete. We claimthat a complete theory of computer science cannot exist and especially,Turing machines or Interaction machines cannot be a complete model ofcomputation. However complete models of computation may and shouldbe approximated indefinitely and our contribution presents one of suchattempts.

ABOUT THE PROBLEM OF CLASSIFICATION OF THE CONCEPTS OF INFORMATICS STUDIED AT SECONDARY SCHOOL

2018 ◽  
pp. 4-7
Author(s):  
S. I. Zenko
Keyword(s):  
Secondary School ◽  
Foreign Language ◽  
Computer Science ◽  
Parts Of Speech ◽  
The Third ◽  
The Cross ◽  
Definition Of

The article raises the problem of classification of the concepts of computer science and informatics studied at secondary school. The efficiency of creation of techniques of training of pupils in these concepts depends on its solution. The author proposes to consider classifications of the concepts of school informatics from four positions: on the cross-subject basis, the content lines of the educational subject "Informatics", the logical and structural interrelations and interactions of the studied concepts, the etymology of foreign-language and translated words in the definition of the concepts of informatics. As a result of the first classification general and special concepts are allocated; the second classification — inter-content and intra-content concepts; the third classification — stable (steady), expanding, key and auxiliary concepts; the fourth classification — concepts-nouns, conceptsverbs, concepts-adjectives and concepts — combinations of parts of speech.

Creating and Capturing Value through Crowdsourcing

2018 ◽  
Keyword(s):  
Information Systems ◽  
Systems Biology ◽  
Computer Science ◽  
Open Innovation ◽  
Product Innovation ◽  
Collective Intelligence ◽  
Innovation Management ◽  
Private And Public ◽  
Definition Of ◽  
The Uk

Examples of the value that can be created and captured through crowdsourcing go back to at least 1714, when the UK used crowdsourcing to solve the Longitude Problem, obtaining a solution that would enable the UK to become the dominant maritime force of its time. Today, Wikipedia uses crowds to provide entries for the world’s largest and free encyclopedia. Partly fueled by the value that can be created and captured through crowdsourcing, interest in researching the phenomenon has been remarkable. For example, the Best Paper Awards in 2012 for a record-setting three journals—the Academy of Management Review, Journal of Product Innovation Management, and Academy of Management Perspectives—were about crowdsourcing. In spite of the interest in crowdsourcing—or perhaps because of it—research on the phenomenon has been conducted in different research silos within the fields of management (from strategy to finance to operations to information systems), biology, communications, computer science, economics, political science, among others. In these silos, crowdsourcing takes names such as broadcast search, innovation tournaments, crowdfunding, community innovation, distributed innovation, collective intelligence, open source, crowdpower, and even open innovation. The book aims to assemble papers from as many of these silos as possible since the ultimate potential of crowdsourcing research is likely to be attained only by bridging them. The papers provide a systematic overview of the research on crowdsourcing from different fields based on a more encompassing definition of the concept, its difference for innovation, and its value for both the private and public sectors.

scholarly journals On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares

Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1895 ◽  
Author(s):  
M. Higazy ◽  
A. El-Mesady ◽  
M. S. Mohamed
Keyword(s):  
Computer Science ◽  
Finite Fields ◽  
Orthogonal Array ◽  
Orthogonal Arrays ◽  
Latin Squares ◽  
Error Correcting Codes ◽  
Recursive Construction ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Definition Of

During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a construction tool for orthogonal arrays. Although Latin squares have numerous helpful properties, for some factual applications these structures are excessively prohibitive. The more general concepts of graph squares and mutually orthogonal graph squares (MOGS) offer more flexibility. MOGS generalize MOLS in an interesting way. As such, the topic is attractive. Orthogonal arrays are essential in statistics and are related to finite fields, geometry, combinatorics and error-correcting codes. Furthermore, they are used in cryptography and computer science. In this paper, our current efforts have concentrated on the definition of the graph-orthogonal arrays and on proving that if there are k MOGS of order n, then there is a graph-orthogonal array, and we denote this array by G-OA(n2,k,n,2). In addition, several new results for the orthogonal arrays obtained from the MOGS are given. Furthermore, we introduce a recursive construction method for constructing the graph-orthogonal arrays.

scholarly journals What is the dynamical hypothesis?

1998 ◽  
Vol 21 (5) ◽  
pp. 633-634 ◽  
Author(s):  
Nick Chater ◽  
Ulrike Hahn
Keyword(s):  
Dynamical System ◽  
Dynamical Systems ◽  
Turing Machines ◽  
Definition Of ◽  
Dynamical Hypothesis

Van Gelder's specification of the dynamical hypothesis does not improve on previous notions. All three key attributes of dynamical systems apply to Turing machines and are hence too general. However, when a more restricted definition of a dynamical system is adopted, it becomes clear that the dynamical hypothesis is too underspecified to constitute an interesting cognitive claim.

Contributions of Thinking Styles to Vocational Purpose beyond Self-Rated Abilities

2004 ◽  
Vol 94 (2) ◽  
pp. 697-714 ◽  
Author(s):  
Li-Fang Zhang
Keyword(s):  
Higher Education ◽  
Computer Science ◽  
Thinking Styles ◽  
Institutions Of Higher Education ◽  
Thinking Style ◽  
Republic Of China ◽  
Complex Thinking ◽  
Collaborative Working ◽  
Definition Of ◽  
Large Research

The present study predicted vocational purpose from thinking styles, a construct at the interface of intelligence and personality. 233 students majoring in history and computer science from a large research-oriented university in the People's Republic of China completed the Thinking Styles Inventory and the Iowa Vocational Purpose Inventory. The participants also rated their own analytical, creative, and practical abilities. In general, results indicated that thinking styles contributed to vocational purpose beyond self-rated abilities. Specifically, the more creativity-generating and complex thinking styles tended to contribute positively to vocational purpose, whereas the more conforming and simplistic thinking styles tended to contribute negatively to vocational purpose. This article points to the need theoretically for integrating the construct of thinking style into the definition of differential psychology. Practical data argue for a collaborative working relationship between teachers and vocational counselors in institutions of higher education.

Classifying the computational complexity of problems

1987 ◽  
Vol 52 (1) ◽  
pp. 1-43 ◽  
Author(s):  
Larry Stockmeyer
Keyword(s):  
Computational Complexity ◽  
Computer Science ◽  
Turing Machine ◽  
Function Theory ◽  
Formal Models ◽  
Additional Structure ◽  
Survey Article ◽  
Definition Of ◽  
Computational Resources ◽  
Degrees Of Unsolvability

One of the more significant achievements of twentieth century mathematics, especially from the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in the 1930's which provided a precise and robust definition of what it means for a problem to be computationally solvable, or decidable, and which showed that there are undecidable problems which arise naturally in logic and computer science. Indeed, when one is faced with a new computational problem, one of the first questions to be answered is whether the problem is decidable or undecidable. A problem is usually defined to be decidable if and only if it can be solved by some Turing machine, and the class of decidable problems defined in this way remains unchanged if “Turing machine” is replaced by any of a variety of other formal models of computation. The division of all problems into two classes, decidable or undecidable, is very coarse, and refinements have been made on both sides of the boundary. On the undecidable side, work in recursive function theory, using tools such as effective reducibility, has exposed much additional structure such as degrees of unsolvability. The main purpose of this survey article is to describe a branch of computational complexity theory which attempts to expose more structure within the decidable side of the boundary.Motivated in part by practical considerations, the additional structure is obtained by placing upper bounds on the amounts of computational resources which are needed to solve the problem. Two common measures of the computational resources used by an algorithm are time, the number of steps executed by the algorithm, and space, the amount of memory used by the algorithm.

scholarly journals Introduction to special issue: Physics and computer science – quantum computation and other approaches

2010 ◽  
Vol 20 (6) ◽  
pp. 995-997 ◽  
Author(s):  
SALVADOR ELÍAS VENEGAS-ANDRACA
Keyword(s):  
Computer Science ◽  
Energy Transport ◽  
Modern Society ◽  
Quantum Walks ◽  
Computer Hardware ◽  
Computer Engineering ◽  
Light Harvesting Complexes ◽  
Models Of Computation ◽  
Natural Processes ◽  
Computational Procedures

Computer science and computer engineering are disciplines that have very definitely permeated and transformed every aspect of modern society. In these fields, cutting-edge research is about new models of computation, new materials and techniques for building computer hardware and novel methods for speeding-up algorithms. But it is also about building bridges between computer science and various other scientific fields, bridges that allow scientists to both think of natural phenomena as computational procedures and to employ novel models of computation to simulate natural processes (for example, quantum walks have been used to model energy transport in photosynthetic light harvesting complexes (Hoyer et al. 2010; Caruso et al. 2010)). A convergence of scientific, technological, economic and epistemological demands is driving and integrating this research.

scholarly journals The Proposal of a Evolutionary Strategy Generating the Data Structures Based on a Horizontal Tree for the Tests

2016 ◽  
Vol 23 (3) ◽  
pp. 145-149
Author(s):  
Marek Żukowicz ◽  
Michał Markiewicz
Keyword(s):  
Mathematical Model ◽  
Evolutionary Algorithm ◽  
Computer Science ◽  
Data Structures ◽  
Evolutionary Strategy ◽  
Future Research ◽  
Object Model ◽  
The Third ◽  
Testing Data ◽  
Definition Of

Abstract The aim of the article is to present a mathematical definition of the object model, that is known in computer science as TreeList and to show application of this model for design evolutionary algorithm, that purpose is to generate structures based on this object. The first chapter introduces the reader to the problem of presenting data using the TreeList object. The second chapter describes the problem of testing data structures based on TreeList. The third one shows a mathematical model of the object TreeList and the parameters, used in determining the utility of structures created through this model and in evolutionary strategy, that generates these structures for testing purposes. The last chapter provides a brief summary and plans for future research related to the algorithm presented in the article.

scholarly journals About Students’ Abstractions - Evaluation of Items Requiring Abstract Thinking Competence

2019 ◽  
Author(s):  
Daniela Zehetmeier
Keyword(s):  
Computer Science ◽  
Assessment Tool ◽  
Object Oriented Programming ◽  
Abstract Thinking ◽  
Competence Model ◽  
First Semester ◽  
Competence Level ◽  
University Level ◽  
Definition Of ◽  
Incoming Students

Abstract thinking is one of the most important competences in computer science. When starting my research, there was no complete definition of the competence nor was there a tool to assess first-semester students’ competence level. Thus, I developed a competence model of abstract thinking, which allowed me to derive an assessment tool. In this work, I will present first insights gained by analyzing the tests of 134 incoming students of computer science and scientific computing. The analysis confirms the assumption that incoming students often lack in this essential competence. Moreover, the overemphasis of the data aspect of classes in object oriented programming can be confirmed for university level education. Further investigations will follow. In the future, the insights gained can be used to develop teaching units or whole teaching concepts. 

scholarly journals A Theoretical Computer Science Perspective on Consciousness

2021 ◽  
pp. 2150002
Author(s):  
Manuel Blum ◽  
Lenore Blum
Keyword(s):  
Computer Science ◽  
Turing Machine ◽  
Scientific Evidence ◽  
Complex Model ◽  
Theoretical Computer Science ◽  
Formal Definition ◽  
Theoretical Computer ◽  
Complex Concept ◽  
Definition Of ◽  
The Brain

The quest to understand consciousness, once the purview of philosophers and theologians, is now actively pursued by scientists of many stripes. This paper studies consciousness from the perspective of theoretical computer science. It formalizes the Global Workspace Theory (GWT) originated by the cognitive neuroscientist Bernard Baars and further developed by him, Stanislas Dehaene, and others. Our major contribution lies in the precise formal definition of a Conscious Turing Machine (CTM), also called a Conscious AI. We define the CTM in the spirit of Alan Turing’s simple yet powerful definition of a computer, the Turing Machine (TM). We are not looking for a complex model of the brain nor of cognition but for a simple model of (the admittedly complex concept of) consciousness. After formally defining CTM, we give a formal definition of consciousness in CTM. We later suggest why the CTM has the feeling of consciousness. The reasonableness of the definitions and explanations can be judged by how well they agree with commonly accepted intuitive concepts of human consciousness, the range of related concepts that the model explains easily and naturally, and the extent of its agreement with scientific evidence.

Sign in / Sign up

Export Citation Format

Share Document