384,166 Hits in 3.0 sec

Elementary formal systems, intrinsic complexity, and procrastination

Sanjay Jain, Arun Sharma
1996 Proceedings of the ninth annual conference on Computational learning theory - COLT '96  
results that relate topological properties of learnable classes to that of intrinsic complexity and ordinal mind change complexity.  ...  In addition to building bridges between three distinct areas of inductive inference, viz., learnability of EFS subclasses, ordinal mind change complexity, and intrinsic complexity, this paper also presents  ...  EFS Subclasses and Intrinsic Complexity In this section, we compare the intrinsic complexity of unions of pattern languages and languages of bounded cardinality.  ... 
doi:10.1145/238061.238093 dblp:conf/colt/JainS96 fatcat:hhf2x657qvaz3cvn7j6bmmiolu

Introduction to Focus Issue: Intrinsic and Designed Computation: Information Processing in Dynamical Systems—Beyond the Digital Hegemony

James P. Crutchfield, William L. Ditto, Sudeshna Sinha
2010 Chaos  
The Focus Issue on Intrinsic and Designed Computation asks what the theory of nonlinear dynamical systems has to offer in response.  ...  It is a question that also returns one to the earliest days of the foundations of dynamical systems theory, probability theory, mathematical logic, communication theory, and theoretical computer science  ...  Ever since these transdisciplinary innovations, dynamical systems, information theory, and computation theory have been key tools for probing how complex systems store and generate information-that is,  ... 
doi:10.1063/1.3492712 pmid:20887067 fatcat:fnbe3htoenc2fjbybmltzlhj4a

Toward Computational Motivation for Multi-Agent Systems and Swarms

Md Mohiuddin Khan, Kathryn Kasmarik, Michael Barlow
2018 Frontiers in Robotics and AI  
However, there are only a few works that focus on motivation theories in multi-agent or swarm settings.  ...  In this study, we review current computational models of motivation settings, mechanisms, functions and evaluation methods and discuss how we can produce systems with new kinds of functions not possible  ...  We believe this aspect makes intrinsic motivation more complex and interesting.  ... 
doi:10.3389/frobt.2018.00134 pmid:33501012 pmcid:PMC7806096 fatcat:afbsmnodtbdgvhgyzsbykdwniu

Dynamical Emergence of Phenomenal Consciousness: an Outline of a Theory

Roy Moyal, Shimon Edelman
2019 AAAI Spring Symposia  
macrostates and their intrinsic (observer-independent) topology and geometry.  ...  We outline a computational theory of phenomenal conscious experience.  ...  The computational realizer of experience (CRE) is an intrinsically structured emergent pattern of states and transitions over PSE.  ... 
dblp:conf/aaaiss/MoyalE19 fatcat:toibmas3fnbwvevohw4gs6ux4e

Nature computes: Information processing in quantum dynamical systems

Karoline Wiesner
2010 Chaos  
So-called intrinsic quantum computation combines tools from dynamical systems theory, information theory, quantum mechanics, and computation theory.  ...  Here, we will review how a synthesis of dynamical systems theory, information theory, physics, and computation theory leads to methods for analysis of how quantum processes store and manipulate information-what  ...  Here, we will review how a synthesis of dynamical systems theory, information theory, physics, and computation theory leads to methods for analysis of how quantum processes store and manipulate information-what  ... 
doi:10.1063/1.3491238 pmid:20887080 fatcat:3hykwtqpmjhwldvuw7ss4qp3o4

A Formal Theory of Creativity to Model the Creation of Art [chapter]

Jürgen Schmidhuber
2012 Computers and Creativity  
Low-Complexity Art as End Product of a Search Process Modeled by the Formal Theory of Creativity Low-complexity art (Schmidhuber; 1997c) may be viewed as the computer-age equivalent of minimal art.  ...  According to the Formal Theory of Creativity, his intrinsic fun is the difference between how much computational effort he needs to encode the data before and after learning to encode it more efficiently  ... 
doi:10.1007/978-3-642-31727-9_12 fatcat:gpf674w56bffpdn7cb7j2idnkm

Inducing chemical reactivity on specific sites of a molecule using the Coulomb interaction exerted by a low energy electron

Daly Davis, Y. Sajeev
2018 Physical Chemistry, Chemical Physics - PCCP  
of theory for the molecular complex containing diazene and CO 2 moieties.  ...  energy computed using coupled cluster theories for the intrinsic reaction path (IRP) shown inFig. 3of the main article.  ... 
doi:10.1039/c7cp08496j pmid:29372730 fatcat:flqcxkelcjfgfp72nkjedkvgbq

A comment on Tononi & Koch (2015) 'Consciousness: here, there and everywhere?'

Adam B. Barrett
2016 Philosophical Transactions of the Royal Society of London. Biological Sciences  
I thank Anil Seth and Daniel Bor for feedback on a draft of this piece.  ...  (general relativity), and Maxwell's theory of electromagnetism.  ...  It is a beautiful idea that consciousness could in some sense be identified with intrinsic integrated information, and it is fascinating to contemplate a theory of consciousness that has the potential  ... 
doi:10.1098/rstb.2014.0198 pmid:26729923 pmcid:PMC4760185 fatcat:n3rftxzwgfa5bhqc7jyidnwt4y

Invitation to complexity theory

Oded Goldreich
2012 XRDS Crossroads The ACM Magazine for Students  
Complexity Theory is a central field of the theoretical foundations of Computer Science. It is concerned with the study of the intrinsic complexity of computational tasks.  ...  Absolute Goals and Relative Results Saying that Complexity Theory is concerned with the study of the intrinsic complexity of computational tasks means that its "final" goals include the determination of  ...  Still, Complexity theory sheds light on the intrinsic limitations of learning (in this sense). Complexity theory deals with a variety of computational tasks.  ... 
doi:10.1145/2090276.2090285 fatcat:tk7wup7s5bdgricpz5a2qnj6gm

Page 3448 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
Comput. 26 (1997), no. 5, 1524-1540. Quantum computability theory (QC) is a new, radical, and wel- come variant on classical computability theory (CC).  ...  The welcome aspect of QC stems from its promise, as a developing theory, to answer some immediate questions: How closely does QC mirror CC’s complexity paradigms and is the complexity-theoretic version  ... 

Is Anything Ever New? Considering Emergence [chapter]

James P. Crutchfield
2008 Emergence  
Copyright and all rights therein are maintained by the author(s).  ...  SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute.  ...  With careful attention to the location of the observer and the system-under-study, with detailed accounting of intrinsic computation, with quantitative measures of complexity, we can analyze the patterns  ... 
doi:10.7551/mitpress/9780262026215.003.0018 fatcat:3xg2rbfv55gsdffsr53m56jltm

Measuring algorithmic interpretability: A human-learning-based framework and the corresponding cognitive complexity score [article]

John P. Lalor, Hong Guo
2022 arXiv   pre-print
We show that the measurement framework and the resulting cognitive complexity score have the following desirable properties - universality, computability, uniqueness, and monotonicity.  ...  In this work, we build upon programming language theory and cognitive load theory to develop a framework for measuring algorithmic interpretability.  ...  We build upon programming language theory and cognitive load theory to model algorithm intrinsic complexity and human cognitive constraints.  ... 
arXiv:2205.10207v1 fatcat:66k4dhodarbdxdbcy5niov7s3a

Page 25 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
25 03D Recursion theory are random in the complexity-theoretic sense of Kolmogorov and Chaitin. Here is a typical example.  ...  {For the entire collection see MR 97m:68001.} 98a:03066 03D20 03D15 Kristiansen, Lars (N-OSLO-C; Oslo) Information content and computational complexity of recursive sets.  ... 

Page 7274 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
We discuss and relate the basic notions of both theories: Shannon entropy, Kolmogorov complexity, Shannon mutual infor- mation and Kolmogorov (‘algorithmic’) mutual information.  ...  Summary: “We compare the elementary theories of Shannon in- formation and Kolmogorov complexity, the extent to which they have a common purpose, and where they are fundamentally dif- ferent.  ... 

Page 2266 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
“Compared to its counterparts in communications (Shannon's information theory), computations (computational complexity and information-based complexity), and approximations (n- widths and Kolmogorov entropy  ...  We discuss them from the point of view of computational complexity and also point out many open problems.  ... 
« Previous Showing results 1 — 15 out of 384,166 results