Differences

This shows you the differences between two versions of the page.

--- public:t-713-mers:mers-23:empirical-reasoning-1 [2023/10/18 10:39] – [Empirical Reasoning vs. Mathematical Reasoning] thorisson
+++ public:t-713-mers:mers-23:empirical-reasoning-1 [2024/08/20 12:20] (current) – [Empirical Reasoning vs. Mathematical Reasoning] thorisson
@@ Line 38: / Line 38: @@
 ^  **TOPIC**   ^  **MATHEMATICAL REASONING**  ^  **EMPIRICAL REASONING**  ^
 |  \\ Target Use  |  Specify/define complete ruleset/system for closed worlds. \\ Intended for use with necessary and sufficient info. \\ Meant for dealing with mathematical domains.  |  Figure out how to get new things done in open worlds. \\ Intended for use with incomplete and insufficient info. \\ Meant for dealing with physical domains.     |
-|  World Assumption  |  Closed and certain.  \\ Axioms fully known and enumerated. \\ Axiomatic and Platonic (hypothetical) |  Open and uncertain (actual): Every known axiom is defeasible<sup>1</sup> (not guaranteed); \\ at least one unknown axiom exist at all times.  |
+|  World Assumption  |  Closed and certain.  \\ Axioms fully known and enumerated. \\ Axiomatic and Platonic (hypothetical)  |  Open and uncertain. \\ at least one unknown axiom exist at all times; \\ every known axiom is defeasible<sup>1</sup> (not guaranteed). \\   |
-|  Energy, Time, Space  |  Independent of energy, space and time \\ (unless specifically put into focus).  |  Limited by time, energy and space; \\ LTE (limited time and energy) is a central concept.  |
+|  Energy, Time, Space  |  Independent of energy, space and time \\ (unless specifically put into focus).  |  Limited by time, energy and space; \\ LEST (limited energy, space and time) is a central concept.  |
 |  Source of Data  |  Mostly hand-picked by humans from a pre-defined World.    |  Mostly measured by reasoning system itself, \\ from a mostly undefined World.   |
 |  Human-Generated Info  |  Large ratio of human to machine-generated info (>1). Human-generated info is detailed and targets specific topics and tasks.   |   Small ratio of human to machine-generated info (<<1). Human-generated info is provided in a small 'seed' and targets general bootstrapping.   |
@@ Line 46: / Line 46: @@
 |  Data Availability  |  Most data is available. No hidden data.  |  Most data is unavailable and/or hidden.   |
 |  Data Types  |  Known a-priori. Statements always syntactically correct; pre-defined syntax.   |  Mostly not known; tiny dataset provided a-priori.  |
-|  Permitted Values  |  Bool (True, False)  |  Combinations of Bool, N, Z, Q, R, C.  |
+|  Permitted Values  |  Primarily Bool (True, False)  |  Highly variable combinations of Bool, N, Z, Q, R, C, \\ **as well as 'uncertain' and 'not known'.**  |
 |  Information Amount  |  Inevitably sparse (due to being fully known).  |  Always larger than available processing - overwhelming.   |
 |  Statements  |  Clear, clean and complete.   |  Most statements are incomplete; rarely clear and clean.   |
 |  Incorrect Statements  |  Guaranteed to be identifiable.   |  Cannot be guaranteed to be identifiable.  |
-|  Deduction  |  Safe<sup>2</sup> and complete<sup>3</sup> (due to complete and clean data and semantics).  |  Defeasible (always, due to incomplete data and semantics).   |
+|  Deduction  |  Safe<sup>2</sup> and complete<sup>3</sup> (due to complete and clean data and semantics).  |  Defeasible \\ (//always//, due to incomplete data and semantics).   |
 |  Abduction  |  Safe and complete \\ (always, due to complete knowledge).  |  Defeasible \\ (always, due to incomplete knowledge).   |
 |  Induction  |  Defeasible \\ (always, due to incomplete data).  |  Defeasible \\ (always, due to incomplete data and semantics).   |
 |  Analogy  |  Complete \\ (always, due to complete knowledge of data and semantics).  |  Defeasible \\ (always, due to With incomplete data and semantics).   |
 | |||
-| <sup>1</sup> By 'defeasible' is meant that with additional data it may be found to be incorrect.  |||
+| <sup>1</sup> By 'defeasible' is meant that it //may// be found to be incorrect, at any time, given additional data, reconsideration of background assumptions or discovery of logic errors.  |||
-| <sup>2</sup> By 'safe' is meant that the output of a reasoning process can be trusted and is provably correct.  |||
+| <sup>2</sup> By 'safe' is meant that the output of a reasoning process is provably correct and can be trusted.  |||
 | <sup>3</sup> By 'complete' is meant that the output of a reasoning process leaves nothing unprocessed.  |||