compiseverythng ([info]compiseverythng) wrote,
@ 2005-10-20 14:34:00
Previous Entry  Add to memories!  Tell a Friend  Next Entry
Test tonight
Here are my proposed answers to the test.

A find myself annoyed at the idea of a test. Ha ha.



  1. What is Universal Automatism?

  2. The idea that everything in the universe is at its root a computation on some field.

  3. What is a computation?

  4. A computation is a finite step well defined steps based on input.

  5. What is the dielectric tirade in the books title?

  6. The dielectric is the seeming contradiction between computation as represented in the idea of a life box that can computationally represent a person and the soul which viewed as an ethereal truth of "unknowable" quality. The resolution is the sea shell, which while a computation is unpredictable and unknowable except be carrying out the complete and irreducible computation.
  7. What does it mean to say a computation P is unpredictable?

  8. It means that the order of steps in the computation cannot be reduced to discover the outcome.

  9. What does it mean to say Q emulates P?

  10. Q emulates P iff every computation P can do Q can do better -- I joke -- Q comes up with the same answer as P given the same data.
  11. What are Wolfram's four classes of computations?

    1. Boring

    2. Structured

    3. Really interesting

    4. Einstein's nightmare


  12. What is the PCE?

  13. The principle of computational equivalence. The idea that Rudy and I are equally sophisticated, along with sea shell.

  14. What is the PCU?

  15. The principle of computational unpredictability. Not only are Rudy and I equally sophisticated but we are both unpredictable, along wtih the sea shell.

  16. What does it mean to say a computation P is universal?

  17. A computation is universal iff it can carry out all computations.
    I.e. it can emulate another computation.
  18. What are rules 30 and 100 for 1-demensional cellular automata, and what are they interesting?

  19. These are two rules for cellular automata that show "gnarly"
    behavior. That is the are class three computations.
  20. What are some examples of computational speed up?

  21. Addition and subtraction with carry and borrow rather than counting. Integration rather than adding.

  22. What is Von Neuman's "Stored Program?"

  23. Well lets see. Is it like a computer? Is it like a set of instructions that look like data that are interpreted by a particular machine to carry out an algorithm?

  24. What are these cellular automata, Life, Vote, Brain, Rule 30, & 110?

  25. This is much too hard, this isn't chemistry!

  26. What are Belousov-Zhabotinsky scrolls and what are the rules that make them?

  27. The are complex, gnarly patterns, that are more or less self-sustaining, that have a scroll like shape. The are create by activator inhibitor rules, logistic rules,

  28. Discuss Analog vs. Discrete?

  29. Analog is the idea that there are many, possibly infinite, states in a quantity, and discrete means there are few, usually 10s or 100s of states.

  30. What are Real Number, or continuous value, CAs?

  31. It is a CA where each cell is represented by a many level or continuous state value.

  32. What is the CA rule for wave equation like behavior? What is the CA for the heat rule?


    • Now we are really getting hard.

    • Wave: C-new = C + Avg- Neighborhood (C-old) - C-old

    • Heat: C-new = (1 - a) * C + a * Avg-Neighborhood (C)


  33. Discuss the beach ball into the bin experiment. How can we say it is deterministic?

  34. This is almost a language problem. After all what is that we mean by random if it is not that we can't predict which way the ball is going to bounce. But we can explain -- that is appeal to -- the minute unknowns, the position of the moon and planets to explain. I.e. to slightly different, if imperceptible, differences in initial conditions.

  35. Discuss what it means for a computation to be chaotic.

  36. It is highly sensitive to differences in initial conditions.

  37. What does Wolfram mean by Intrinsic Randomness, being unpredictable?

  38. Who knows, the man is crazzzy. See above.

  39. How might we evade the apparent non-determinism of quantum mechanics?

  40. We can appeal to hidden variables, we can assume the future effects the past, we can pray.

  41. What are the computational requirements for life? And what
    are the implications at a system level?

  42. Reproduction + Morphogenesis + Homeostasis -> Life

    Life -> Ecology + Evolution.

  43. Why does Rucker call DNA a "tweak" parameters?

  44. Because it is not a blueprint for life, but it needs the box.

  45. Discuss morphogenesis? What are the CA rules that demonstrate morphogenesis?

  46. activator-inhibitor

  47. What are some of the Turing Patters?

  48. Cow Spots

  49. What are the CA rules that create chaotic population size? What is a logistic map?

  50. Logistic Rule

  51. What are the elements required for an evolutionary systems?

  52. Life

  53. Discuss evolution as search in a fitness landscape.

  54. The fitness landscape may have many steep peaks and therefore search algorithms that of are the same dimensional complexity as the space cannot easily find the peeks, because they tend to get stuck at local maxima.




(1 comment) - (Post a new comment)


[info]hfx_ben
2005-11-17 05:42 pm UTC (link)
see above re: <lj-cut>

:-)

(Reply to this)


(1 comment) - (Post a new comment)

Create an Account
Forgot your login or password?
Login w/ OpenID
English • Español • Deutsch • Русский…