Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner
Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner
Pitzer Faculty Publications and Research
Weizenbaum's statement is a compelling exhortation to his fellow professionals; nevertheless, I cannot wholly agree. It should be possible for nonprofessionals to understand, as a result of their own reading and experience, how computers interact with the rest of human life. The problems are not just technical, and their nature is not entirely unprecedented.
Data Flow Program Graphs, Alan L. Davis, Robert M. Keller
Data Flow Program Graphs, Alan L. Davis, Robert M. Keller
All HMC Faculty Publications and Research
Data flow languages form a subclass of the languages which are based primarily upon function application (i.e., applicative languages). By data flow language we mean any applicative language based entirely upon the notion of data flowing from one function entity to another or any language that directly supports such flowing. This flow concept gives data flow languages the advantage of allowing program definitions to be represented exclusively by graphs. Graphical representations and their applications are the subject of this article.
Probabilistic Simulations, Nicholas J. Pippenger
Probabilistic Simulations, Nicholas J. Pippenger
All HMC Faculty Publications and Research
The results of this paper concern the question of how fast machines with one type of storage media can simulate machines with a different type of storage media. Most work on this question has focused on the question of how fast one deterministic machine can simulate another. In this paper we shall look at the question of how fast a probabilistic machine can simulate another. This approach should be of interest in its own right, in view of the great attention that probabilistic algorithms have recently attracted.