Events and Sightings von Kita, Chigusa

Volltext

Patrick C. Fischer, 75, Early Unabomber Target von Vitello, Paul

Volltext

Review: Patrick C. Fischer, On Formalisms for Turing Machines; Stal Aanderaa, Patrick C. Fischer, The Solvability of the Halting Problem for 2-State Post Machines; Patrick C. Fischer, Quantificational Variants on the Halting Problem for Turing Machines von Herman, Gabor T

Volltext

Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The solvability of the halting problem for 2-state Post machines. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 677–682. - Patrick C. Fischer. Quantificational variants on the halting problem for Turing machines. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 (1969), pp von Herman, Gabor T.

Volltext

Review: Patrick C. Fischer, Theory of Provable Recursive Functions von Enderton, H. B

Volltext

Review: Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg, Time-Restricted Sequence Generation von Becvar, Jiri

Volltext

Review: Patrick C. Fischer, A Note on Bounded-Truth-Table Reducibility von Young, Paul R

Volltext

Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Time-restricted sequence generation. Journal of computer and system sciences, vol. 4 (1970), pp. 50–73 von Bečvář, Jiˇrí

Volltext

Patrick C. Fischer. Theory of provable recursive functions. Transactions of the American Mathematical Society, vol. 117 (1965), pp. 494–520 von Enderton, H. B.

Volltext

Patrick C. Fischer. A note on bounded-truth-table reducibility. Proceedings of the American Mathematical Society, vol. 14 (1963), pp. 875–877 von Young, Paul R.

Volltext

Generation of Primes by a One-Dimensional Real-Time Iterative Array von Fischer, Patrick C

Volltext

Computational speed-up by effective operators von Meyer, Albert R., Fischer, Patrick C.

Volltext

Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard von Fischer, Patrick C., Tsou, Don-Min

Volltext

The complexity of recognizing 3NF relation schemes von Jou, Jiann H., Fischer, Patrick C.

Volltext

On Formalisms for Turing Machines von Fischer, Patrick C.

Volltext

Decomposition of a relation scheme into Boyce-Codd Normal Form von Tsou, Don-Min, Fischer, Patrick C

Volltext

Real-Time Simulation of Multihead Tape Units von Fischer, Patrick C., Meyer, Albert R., Rosenberg, Arnold L.

Volltext

Multi-tape and infinite-state automata-a survey von Fischer, Patrick C.

Volltext

The Solvability of the Halting Problem for 2-State Post Machines von Aanderaa, Stal, Fischer, Patrick C

Volltext

Storage reorganization techniques for matrix computation in a paging environment von Fischer, Patrick C., Probert, Robert L.

Volltext