Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jerome Rothstein

dblp:95/5646 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-authorTheory of computation · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 77% Computational complexity · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
cellular automata
0.011979
Bus Automata and Immediate Languages · Inf. Control. 1979
Computational complexity › computational models
parallel computation models
0.011979
Bus Automata and Immediate Languages · Inf. Control. 1979
YearPublicationVenuePosition
1988 Bus automata, brains, and mental models
abstract
The author suggests that bus automata (BAs) may serve as better brain models than sequential computers of cellular automata. He proposes to view self-simulationability, together with the use of status flags and the like, as a primitive model of self-consciousness, analogous to viewing a regulator as exhibiting rudimentary purposive behavior. A discussion of what meanings might be ascribed in a BA context to terms like intelligence, pattern, theory, and meaning itself is also given. It is concluded that the BA-UTM (universal Turing machine) is a promising candidate for a brain model whose operation may actually be relevant to mental processes. Prospects for actual BA-UTM realization are briefly discussed.>
Jerome Rothstein
IEEE Trans. Syst. Man Cybern.1
1987 Immediate Parallel Solution of the Longest Common Subsequence Problem
David M. Champion, Jerome Rothstein
ICPP2
1979 Bus Automata and Immediate Languages
J. Michael Moshell, Jerome Rothstein
Inf. Control.2
1959 Residues of Binary Numbers Modulo Three
Jerome Rothstein
IRE Trans. Electron. Comput.1
1954 Information, organization and systems
Jerome Rothstein
Trans. IRE Prof. Group Inf. Theory1