day37 - Bibliography Prusinkiewicz & Lindenmayer The...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 11 Bibliography The algorithmic beauty of plants, 1990, Springer – Verlag Prusinkiewicz et al. L-systems and beyond, Siggraph 2003 course notes Both available online at: http://algorithmicbotany.org/papers/
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 Halting vs Mortality The Halting Problem (Set Halt) Given an arbitrary machine M and starting configuration C, does M halt eventually when started on C The Uniform Halting Problem (Set Total) Given an arbitrary machine M does M halt eventually no matter what finite configuration it is started on? The Mortality Problem (Set Mortal) Given an arbitrary machine M does M halt eventually no matter what configuration (finite or infinite) it is started on?
Background image of page 2
Dec 2, © UCF (Charles E. 33 Finite vs Infinite? Consider the machine that computes x+1, given input x, leaving its input unaltered. Unary notation. Copy x 1’s. Append a 1. On finite input x, machine eventually
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 10

day37 - Bibliography Prusinkiewicz & Lindenmayer The...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online