Peirce’s Theory of Signs Stanford Encyclopedia of Philosophy

Peirce’s Sign Theory, or Semiotic, is an account of signification, representation, reference and meaning. Although sign theories have a long history, Peirce’s accounts are distinctive and innovative for their breadth and complexity, and for capturing the importance of interpretation to signification. For Peirce, developing a thoroughgoing theory of signs was a central philosophical and intellectual preoccupation. The importance of semiotic for Peirce is wide ranging. As he himself said, “[…] it has never been in my power to study anything,—mathematics, ethics, metaphysics, gravitation, thermodynamics, optics, chemistry, comparative anatomy, astronomy, psychology, phonetics, economics, the history of science, whist, men and women, wine, metrology, except as a study of semiotic”. (SS 1977, 85–6). Peirce also treated sign theory as central to his work on logic, as the medium for inquiry and the process of scientific discovery, and even as one possible means for ‘proving’ his pragmatism. Its importance in Peirce’s philosophy, then, cannot be underestimated.

Peirce’s Theory of Signs Stanford Encyclopedia of Philosophy.

Ulysses (novel) – Wikipedia, the free encyclopedia

Episode 14, Oxen of the Sun
This chapter is remarkable for Joyce’s wordplay, which seems to recapitulate the entire history of the English language. After a short incantation in Irish, the episode starts with latinate prose, Anglo-Saxon alliteration, and moves on through parodies of, among others, Malory, the King James BibleBunyanDefoeSterne,WalpoleGibbonDickens, and Carlyle, before concluding in a haze of nearly incomprehensible slang.

via Ulysses (novel) – Wikipedia, the free encyclopedia.

RE (complexity) – Wikipedia, the free encyclopedia

In computability theory and computational complexity theoryRE (recursively enumerable) is the class of decision problems for which a ‘yes’ answer can be verified by a Turing machine in a finite amount of time.[1] Informally, it means that if the answer is ‘yes’, then there is some procedure which takes finite time to determine this. On the other hand, if the answer is ‘no’, the machine might never halt. Equivalently, RE is the class of decision problems for which a Turing machine can list all the ‘yes’ instances, one by one (this is what ‘enumerable’ means).

Similarly, co-RE is the set of all languages that are complements of a language in RE. In a sense, co-RE contains languages of which membership can be disproved in a finite amount of time, but proving membership might take forever.

Each member of RE is a recursively enumerable set and therefore a Diophantine set.

RE (complexity) – Wikipedia, the free encyclopedia.

 

First computer to sing – Daisy Bell – YouTube

“Daisy Bell” was composed by Harry Dacre in 1892. In 1961, the IBM 7094 became the first computer to sing, singing the song Daisy Bell. Vocals were programmed by John Kelly and Carol Lockbaum and the accompaniment was programmed by Max Mathews. This performance was the inspiration for a similar scene in 2001: A Space Odyssey.

via First computer to sing – Daisy Bell – YouTube.

Larry Constantine – Wikipedia, the free encyclopedia

Larry Constantine – Wikipedia, the free encyclopedia

Structured Design

Constantine, who learned programming at the Massachusetts Institute of Technology, began his professional career in computers with a summer job at Scientific Computing, at the time a subsidiary of Control Data Corporation, in Minneapolis. He went on to full-time work at MIT’s Laboratory for Nuclear Science, where he wrote routines for analyzing spark chamber photographs, and then to C-E-I-R, Inc., where he worked on economics simulations, business applications, project management tools, and programming languages.

While still an undergraduate at MIT he began work on what was to become structured design, formed his first consulting company, and taught in a postgraduate program at the University of Pennsylvania Wharton School. The core of structured design, including structure charts and coupling and cohesion metrics, was substantially complete by 1968, when it was presented at the National Symposium on Modular Programming. He joined the faculty of IBM’s Systems Research Institute the same year, where he taught for four years and further refined his concepts.

As part of Structured Design, Constantine developed the concepts of cohesion (the degree to which the internal contents of a module are related) and coupling (the degree to which a module depends upon other modules).[7] These two concepts have been influential in the development of software engineering, and stand alone from Structured Design as significant contributions in their own right. They have proved foundational in areas ranging from software design to software metrics, and indeed have passed into the vernacular of the discipline.

Constantine also developed methodologies that combine human-computer-interaction design with software engineering. One methodology, usage-centered design, is the topic of his 1999 book with Lucy Lockwood, “Software For Use”. This is a third significant contribution to the field, being both well used in professional practice and the subject of academic study, and taught in a number of human-computer interface courses and universities around the world. His work on Human-Computer Interaction was influential for techniques like essential use cases and usage-centered design, which are widely used for building interactive software systems.