| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| public:t-720-atai:atai-24:task-environments [2024/01/22 16:43] – [The Physical World] thorisson | public:t-720-atai:atai-24:task-environments [2024/04/29 13:33] (current) – external edit 127.0.0.1 |
|---|
| [[/public:t-720-atai:atai-22:main|T-720-ATAI-2022 Main]] \\ | [[/public:t-720-atai:atai-24:main|T-720-ATAI-2024Main]] \\ |
| [[/public:t-720-atai:atai-22:lecture_notes|Lecture Notes 2022]] | [[/public:t-720-atai:atai-24:lecture_notes|Lecture Notes 2024]] |
| | |
| [[/public:t-713-mers:mers-23:main|T-713-MERS-2023 Main]] \\ | |
| [[/public:t-713-mers:mers-23:lecture_notes|Link to Lecture Notes]] | |
| |
| \\ | \\ |
| | Reliable Regularity | To do anything //reliably// means depending on //reliable regularity// which is conducive to prediction. | | | Reliable Regularity | To do anything //reliably// means depending on //reliable regularity// which is conducive to prediction. | |
| | AI Boils Down To | Building machines that can figure out what can be reliably achieved in uncertain worlds. | | | AI Boils Down To | Building machines that can figure out what can be reliably achieved in uncertain worlds. | |
| | \\ \\ Abstract Worlds | We may of course define any kind of "world" of our choosing. However, if it is to be **implemented** it must run using some physical properties, be it an abacus, transistors, light, or something else, and if uses physical properties these //must obey physical laws//, which means that \\ //1. an abstract AI that cannot be implemented is not intelligent (it is a blueprint for something else), and \\ 2. any AI must be able to address - using intelligence - physical properties//. | | | \\ \\ Abstract Worlds | We may of course define any kind of "world" of our choosing. However, if it is to be **implemented** it must run using some physical properties, be it an abacus, transistors, light, or something else, and if uses physical properties these //must obey physical laws//, which means that \\ //1. an abstract AI that cannot be implemented is not intelligent (but it could be a **blueprint** for something else), and \\ 2. any AI must be able to address - using intelligence - physical properties//. | |
| |
| \\ | \\ |
| | **W**: \\ A World | **W = { V,F,S<sub>0</sub>,R }** || | | **W**: \\ A World | **W = { V,F,S<sub>0</sub>,R }** || |
| | **V**: \\ Variables | **V = { v<sub>1</sub>, v<sub>2</sub>, . . . , v{||V||} }** || | | **V**: \\ Variables | **V = { v<sub>1</sub>, v<sub>2</sub>, . . . , v{||V||} }** || |
| | **F**: \\ Transition Functions | \\ **F** is a set of transition functions / rules describing how the variables can change. \\ The dynamics can intuitively be thought of as the world’s “laws of nature”, continually transforming the world’s current state into the next: **S{t+δ} = F(S<sub>t</sub>)**. || | | **F**: \\ Transition Functions | **F** is a set of transition functions / rules describing how the variables can change. \\ The dynamics can intuitively be thought of as the world’s “laws of nature”, continually transforming the world’s current state into the next: **S{t+δ} = F(S<sub>t</sub>)**. || |
| | **C**: \\ A World Clock | The clock updates the Transition Functions. \\ In the physical world **C** updates **F** (including energy transfer), irrespective of anything and everything else that may happen in the World, constraining how much can happen for any time unit. || | | **C**: \\ A World Clock | The clock updates the Transition Functions. \\ In the physical world **C** updates **F** (including energy transfer), irrespective of anything and everything else that may happen in the World, constraining how much can happen for any time unit. || |
| | **S<sub>0</sub>**: \\ Initial State | **S<sub>0</sub>** is the State that **W** started out in. \\ In any complex world this is unlikely to be known; for artificial worlds this may be defined. || | | **S<sub>0</sub>**: \\ Initial State | **S<sub>0</sub>** is the State that **W** started out in. \\ In any complex world this is unlikely to be known; for artificial worlds this may be defined. || |
| | \\ **R**: \\ Relations | **R** are the relations between variables in the world. These may be unknown or partially known to an //Agent// in the world. || | | \\ **R**: \\ Relations | **R** are the relations between variables in the world. These may be unknown or partially known to an //Agent// in the world. || |
| | ::: | Static World | Changes //State// only through //Agent Action//. | | | ::: | Static World | Changes //State// only through //Agent Action//. | |
| | ::: | Dynamic World | Changes //State// through //Agent Action// and through other means. | | | ::: | Dynamic World | Changes //State// through //Agent Action// and through other means. | |
| | \\ State | **s<sub>t</sub> in V<sub>t</sub>**. A set of variables **x** with a set of values, specified to some particular precision (with constraints, e.g. error bounds), for relevant to a //World//. \\ For all practical purposes, in any complex World "State" refers by default to a sub-state, since it is a practical impossibility to know its full state (values of the complete set of variables) of a world; there will always be a vastly higher number of "don't care" variables than the variables listed for e.g. a //Goal State// (a //State// associated with a //Goal//). || | | \\ State | **s<sub>t</sub> in V<sub>t</sub>**. A set of variables **x** with a set of values, specified to some particular precision (with constraints, e.g. error bounds), for relevant to a //World//. \\ For all practical purposes, in any complex World "State" refers by default to a sub-state, since it is a practical impossibility to know its full state (values of the complete set of variables) of a world; there will always be a vastly higher number of "don't care" variables than the variables listed for e.g. a //Goal State// (a //State// associated with a //Goal//). || |
| | | \\ State \\ definition | **s<sub>t</sub> in V<sub>t</sub>** \\ where \\ **{ x<sub>l</sub>, x<sub>u</sub> } | {x<sub>l</sub> =< x =< x<sub>u</sub>}** \\ defines lower (**x<sub>l</sub>**) and upper (**x<sub>u</sub>**) bounds on acceptable range for each **x** to count towards the State, respectively. | | | | \\ State \\ definition | **s<sub>t</sub> in V<sub>t</sub>** \\ where \\ **{ x<sub>l</sub>, x<sub>u</sub> } | {x<sub>l</sub> =< x =< x<sub>u</sub>}** \\ defines lower (**x<sub>l</sub>**) and upper (**x<sub>u</sub>**) bounds on acceptable range for each **x** to count towards the State, respectively. | |
