Jarkko Kari

ORCID: 0000-0003-0670-6138
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cellular Automata and Applications
  • semigroups and automata theory
  • DNA and Biological Computing
  • Computability, Logic, AI Algorithms
  • Mathematical Dynamics and Fractals
  • Quasicrystal Structures and Properties
  • Algorithms and Data Compression
  • Coding theory and cryptography
  • Logic, programming, and type systems
  • Quantum Computing Algorithms and Architecture
  • Information Retrieval and Search Behavior
  • Formal Methods in Verification
  • Digital Image Processing Techniques
  • Theoretical and Computational Physics
  • Machine Learning and Algorithms
  • Logic, Reasoning, and Knowledge
  • graph theory and CDMA systems
  • Image Retrieval and Classification Techniques
  • Library Science and Information Literacy
  • Advanced Materials and Mechanics
  • Modular Robots and Swarm Intelligence
  • Chaos-based Image/Signal Encryption
  • Advanced Data Compression Techniques
  • Advanced Vision and Imaging
  • Research in Social Sciences

University of Turku
2015-2024

University of South Florida
2022

Ural Federal University
2022

Technical University of Munich
2022

University of Stuttgart
2022

Universitat Politècnica de València
2020

Turku Centre for Computer Science
2002-2014

Tampere University
2001-2011

KU Leuven
2006

University of Iowa
1996-2004

10.1016/j.tcs.2004.11.021 article EN Theoretical Computer Science 2005-02-08

10.1016/s0022-0000(05)80025-x article EN publisher-specific-oa Journal of Computer and System Sciences 1994-02-01

The limit set of a celullar automaton consists all the configurations that can appear after arbitrarily long computations. It is known never empty—it contains at least one homogeneous configuration. A CA called nilpotent if its just present work proves it algorithmically undecidable whether given one-dimensional cellular nilpotent. proof based on generalization well-known result about undecidability tiling problem plane. states remains even considers only so-called NW-deterministic tile...

10.1137/0221036 article EN SIAM Journal on Computing 1992-06-01

10.1016/0012-365x(95)00120-l article EN publisher-specific-oa Discrete Mathematics 1996-11-01

10.1016/0167-2789(90)90195-u article EN Physica D Nonlinear Phenomena 1990-09-01

10.1016/s0304-3975(02)00405-x article EN publisher-specific-oa Theoretical Computer Science 2003-02-01

10.1016/0097-8493(93)90079-o article EN Computers & Graphics 1993-05-01

Abstract There is no algorithm which will take a description of celluar automaton and determine whether it has zero topological entropy, or for any fixed ε > 0 compute its entropy to tolerance e. Furthermore set aperiodic Wang tiles arising from Penrose's kite dart used demonstrate specific examples cellular automata with single periodic point but non-trivial non-wandering sets, furthermore can be constructed have arbitrarily high entropy.

10.1017/s0143385700006738 article EN Ergodic Theory and Dynamical Systems 1992-06-01

10.1016/0304-3975(94)90041-8 article EN Theoretical Computer Science 1994-05-01

Abstract The article discusses lower and higher contexts for information phenomena, argues that there is clearly a need more concerted research effort in the latter sphere. discipline of science has traditionally favored contexts—like everyday life problem solving—that are neutral or even negative by nature. In contrast, neglected things pleasurable profound experiences, activities transcend daily grind. A literature sample scarce related to indicates beyond spotlight mainstream research,...

10.1002/asi.20585 article EN Journal of the American Society for Information Science and Technology 2007-04-25

Purpose The purpose of this paper is to specify user‐defined relevance criteria by which people select hyperlinks and pages in web searching. Design/methodology/approach A quantitative qualitative analysis was undertaken talking aloud data from nine searches conducted about self‐generated topics. Findings Altogether 18 different for selecting were found. selection constituted, two, intertwined processes: the judgment hyperlinks, criteria, decision‐making concerning acceptance or rejection...

10.1108/00220410610714921 article EN Journal of Documentation 2006-11-01

10.1016/j.ic.2019.104481 article EN publisher-specific-oa Information and Computation 2019-10-17

This paper discusses everyday life information seeking via the World Wide Web, and its many contexts at various levels of abstraction. First, empirical Internet-searching studies are reviewed, conclusion which is fact that they yield an exceedingly limited fragmentary picture context activity. Therefore, aim theoretical: to propose – based on holistic reflection earlier literature a truly contextual model Web searching from individual's perspective. The layers life-worlds, domains,...

10.1080/14716310310001631507 article EN New Review of Information Behaviour Research 2003-12-01

Based on the interviews of 18 people in Finland 2001-2, conceptions Internet as an information source were explored. In general, reflect acceptability, accessibility and usability sources. Most appeared to be quite impressionistic, reflecting basic difficulty describing constantly changing nature Internet. Two major kinds identified. First, metaphorical conceptions, was primarily conceived terms space or place, for example, a library bazaar. Second, based actual use experiences significantly...

10.1177/0165551504044667 article EN Journal of Information Science 2004-06-01

10.1016/j.tcs.2018.12.029 article EN publisher-specific-oa Theoretical Computer Science 2019-01-05
Coming Soon ...