Mathematical Foundations of Computer Science 1981: by Jon Louis Bentley, Thomas Ottmann (auth.), Jozef Gruska,

By Jon Louis Bentley, Thomas Ottmann (auth.), Jozef Gruska, Michal Chytil (eds.)

Show description

Read Online or Download Mathematical Foundations of Computer Science 1981: Proceedings, 10th Symposium à trbské Pleso, Czechoslovakia August 31 – September 4, 1981 PDF

Best science books

Time's Arrow and Archimedes' Point: New Directions for the Physics of Time

Why is the long run so various from the previous? Why does the earlier impact the longer term and never the wrong way round? What does quantum mechanics relatively let us know concerning the international? during this vital and obtainable publication, Huw expense throws interesting new mild on a number of the nice mysteries of contemporary physics, and connects them in a totally unique approach.

Souls of Distortion Awakening

This booklet reunites technological know-how and spirituality after her roads separated three hundred years in the past. progressively more scientists are gaining knowledge of that either disciplines are just aspects of a similar coin. we are at the verge of a tremendous paradigm swap in technological know-how the place the immaterial subjective global of the brain can not be separated from the target fabric global.

Advances in Soil Science

The realm wishes for foodstuff and fiber proceed to extend. inhabitants progress within the constructing nations peaked at 2. four percentage a yr in 1965, and has fallen to approximately 2. 1 percentage. although, in lots of constructing international locations virtually part the folks are lower than 15 years of age, poised to go into their efficient and reproductive years.

Extra info for Mathematical Foundations of Computer Science 1981: Proceedings, 10th Symposium à trbské Pleso, Czechoslovakia August 31 – September 4, 1981

Example text

Scientific A m e r i c a n , II. Gill J . T . C o m p u t a t i o n a l c o m p l e x i t y of p r o b a b i l i s t i c Turing m a c h i n e s . - P r o c . 6th ACM Syrup. on T h e o r y of C o m p u t i n g , 1974, 91-95. 12. J a n i g a L. R e a l - t i m e c o m p u t a t i o n s of t w o - w a y m u l t i h e a d finite a u t o m a t a . - P r o c . F u n d a m e n t a l s of Computation Theory FCT' 79, B e r l i n , A k a d e m i e , 1979, 214-218. 13. Jung H. Relationships between p r o b a b i l i s t i c and d e t e r m i n i s t i c tape c o m p l e x i t y .

8. Freivalds R. 74, 1979, 57-69. R. P r o b a b i l i s t i c machines can use less running 9 ' 7 7 , IFtP~ N o r t h - H o l l a n d , 1977: 839-842. time. 3, algorithms. - Lecture Notes in Computer Science~ 44 9. Freivalds R. Recognition of languages by probabilistic Turin 9 machines in real t i m e and by pushdown automata. - Problemy pereda~i informacii ~ v. 15, No. 4, 1979, 96-101 (Russian). I0. Gardner 54. Mathematical games. - Scientific A m e r i c a n , II. Gill J . T . C o m p u t a t i o n a l c o m p l e x i t y of p r o b a b i l i s t i c Turing m a c h i n e s .

Section 5 is short. W e prove that the counterpart of the theorem on the gap in space complexities between const and log log n does not hold for probabilistic Turing machines. It is a very hard problem to c o m p a r e the capabilities of nondeterministic and deterministic 2-way multihead finite automata. This problem is equivalent to the we11known L N L ? problem. L. Janiga [12] proved a hierarchy theorem for languages recognized b y deterministic and nondeterministic multihead finite automata operating in real time.

Download PDF sample

Rated 4.04 of 5 – based on 25 votes