Review of Carruthers’ Massive Modularity Thesis

Perspectives ◽  
2016 ◽  
Vol 6 (1) ◽  
pp. 36-49
Author(s):  
Max Skipper Griffiths
Keyword(s):  
Computer Science ◽  
Approximation Techniques ◽  
Massive Modularity ◽  
Definition Of ◽  
The Mind

Abstract According to Carruthers’ (2006) massive modularity (MM) thesis, the central systems of the mind are widely encapsulated and operate via heuristics and approximation techniques similar to those found in computer science. It follows from this, he claims, that widely encapsulated central systems are feasibly tractable. I argue that insofar as Carruthers uses this weakened definition of encapsulation, his thesis faces a dilemma: either is a misnomer (Prinz, 2006) and therefore unrecognisable as a version of MM, or it isn’t, and must put forward a convincing version of MM (Samuels, 2006). I claim that Carruthers’ commitment to this claim about central systems meets this challenge by adopting an understanding of central systems whose information-frugal and processing-frugal operations allow for feasible tractability. I conclude that the CWT provides a plausible and distinctive account of MM.

Abstraction

2020 ◽  
pp. 38-48
Author(s):  
Stephen K. Reed
Keyword(s):  
Game Theory ◽  
Computer Science ◽  
Visual Images ◽  
Abstract Thinking ◽  
John Von Neumann ◽  
Von Neumann ◽  
Definition Of ◽  
The Mind

The power of abstract thinking is captured by the brilliance of John von Neumann who made many contributions to mathematics, computer science, and game theory. One definition of abstraction is that an instance exists only in the mind (the word truth) rather than in the environment (the word car). An advantage of the latter, concrete examples is they support the formation of visual images to aid recall. A second definition of abstraction is a focus on the most important attributes of an instance. These attributes include those that differentiate one object from another or one category from another. A third definition of abstraction is that an abstract idea applies to many particular instances of a category. Prototypes, rules, and schema are examples.

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.

Introduction

2017 ◽  
Author(s):  
Peter Cheyne
Keyword(s):  
Sustained Attention ◽  
Definition Of ◽  
External Powers ◽  
The Mind

This introductory chapter commences with a definition of contemplation as the sustained attention to the ideas of reason, which are not merely concepts in the mind, but real, external powers that constitute and order being and value, and therefore excite reverence or admiration. A contemplative, Coleridgean position is outlined as a defence in the crisis of the humanities, arguing that if Coleridge is right in asserting that ideas ‘in fact constitute … humanity’, then they must be the proper or ultimate studies of the disciplines that comprise the humanities. This focus on contemplation as the access to essential ideas explains why Coleridge progressed from, without ever abandoning, imagination to reason as his thought evolved during his lifetime. A section on ‘Contemplation: How to Get There from Here’, is followed by a descriptive bibliography of Coleridge as discussed by philosophers, intellectual historians, theologians, and philosophically minded literary scholars.

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.

Contemporary psychosurgery and a look to the future

2001 ◽  
Vol 95 (6) ◽  
pp. 944-956 ◽  
Author(s):  
Robert P. Feldman ◽  
Ronald L. Alterman ◽  
James T. Goodrich
Keyword(s):  
Modern Science ◽  
Psychiatric Disease ◽  
Content Type ◽  
Current State ◽  
Mind And Brain ◽  
Patient Selection Criteria ◽  
Definition Of ◽  
Historical Developments ◽  
The Mind ◽  
Fine Print

Object. Despite a long and controversial history, psychosurgery has persisted as a modern treatment option for some severe, medically intractable psychiatric disorders. The goal of this study was to review the current state of psychosurgery. Methods. In this review, the definition of psychosurgery, patient selection criteria, and anatomical and physiological rationales for cingulotomy, subcaudate tractotomy, anterior capsulotomy, and limbic leukotomy are discussed. The historical developments, modern procedures, and results of these four contemporary psychosurgical procedures are also reviewed. Examples of recent advances in neuroscience indicating a future role for neurosurgical intervention for psychiatric disease are also mentioned. Conclusions. A thorough understanding of contemporary psychosurgery will help neurosurgeons and other physicians face the ethical, social, and technical challenges that are sure to lie ahead as modern science continues to unlock the secrets of the mind and brain.

scholarly journals ‘A transverse scar on the neck’ – psychosomatic approach in the differential diagnosis and surgical treatment of hyperthyroidism in post-war Finland

2021 ◽  
Vol 65 (2) ◽  
pp. 140-156
Author(s):  
Eve-Riina Hyrkäs
Keyword(s):  
Surgical Treatment ◽  
Psychiatric Patients ◽  
Differential Diagnostics ◽  
Historical Study ◽  
Complex Nature ◽  
Surgical Interventions ◽  
Somatic Illness ◽  
Post War ◽  
Definition Of ◽  
The Mind

AbstractIn the Finnish medical discussion during the middle decades of the twentieth century, the challenging differential diagnostics between hyperthyroidism and various neuroses was perceived to yield a risk of unnecessary surgical interventions of psychiatric patients. In 1963, the Finnish surgeon Erkki Saarenmaa claimed that ‘the most significant mark of a neurotic was a transverse scar on the neck’, a result of an unnecessary thyroid surgery. The utterance was connected to the complex nature of thyroid diseases, which seemed to be to ‘a great extent psychosomatic’. Setting forth from this statement, the article aims to decipher the connection between hyperthyroidism, unnecessary surgical treatment and the psychosomatic approach in Finnish medicine. Utilising a wide variety of published medical research and discussion in specialist journals, the article examines the theoretical debate around troublesome diagnostics of functional complaints. It focuses on the introduction of new medical ideas, namely the concepts of ‘psychosomatics’ and ‘stress’. In the process, the article aims to unveil a definition of psychosomatic illness that places it on a continuum between psychological and somatic illness. That psychosomatic approach creates a space with interpretative potential can be applied to the historiography of psychosomatic phenomena more generally. Further inquiry into the intersections of surgery and psychosomatics would enrich both historiographies. It is also argued that the historical study of psychosomatic syndromes may become skewed, if the term ‘psychosomatic’ is from the outset taken to signify something that is all in the mind.

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.

Your Life in Binary Digits

Digitized ◽  
2012 ◽  
Author(s):  
Peter J. Bentley
Keyword(s):  
Computer Science ◽  
Electronic Computer ◽  
Electrical Engineering ◽  
University Of Pennsylvania ◽  
Monday Morning ◽  
Lecture Room ◽  
New Ideas ◽  
The Mind ◽  
The University ◽  
Digital Computers

Your ideas, money, memories, and entertainment are dreams in the minds of computers. But the thoughts of each computer are not simple, they are layered like our own minds. Their lowest, most primitive layers are the instincts of the machine. Middle layers perform more general functions of its silicon mind. Higher layers think about overall concepts. Unlike us, the computer has languages for every layer. We can teach it new ideas by changing any one or all of its layers of thought. We can tell it to consider vast and convoluted concepts. But if we make a single mistake in our instructions, the mind of our digital slave may crash in a virtual epileptic fit. When our silicon students are so pedantic, how can we engineer their thoughts to make them reliable and trustworthy assistants? And if their thoughts become more complicated than anything we can imagine, how can we guarantee they will do what we want them to? . . . Light poured in through the large windows of the lecture room. The sound of scratching pens from nearly thirty distinguished engineers and scientists accompanied every word spoken by John Mauchly. One fellow by the name of Gard from the Wright Field’s Armament Laboratory seemed to be especially diligent, writing hundreds of pages of notes. It was Monday morning, a warm mid-summer day of 1946, some three years after his stimulating tea-time discussions with Turing. Claude Shannon was three weeks into the eight-week course at the Moore School of Electrical Engineering, in the University of Pennsylvania. It had been an honour to be one of the select few invited to hear lectures on designing electronic digital computers. This was the first ever course to be taught on computer science, and Shannon was finding many of the ideas highly stimulating. He’d recently learned a new word from Mauchly: ‘program’ used as a verb. To program an electronic computer was an interesting concept. He was also hearing about some of the politics: apparently two of the lecturers, Mauchly and his colleague Eckert, had resigned from the university just four months ago because of some form of disagreement.

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.

Sign in / Sign up

Export Citation Format

Share Document