◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. Okamoto

4 papers hereh-index 5116.4k citations200 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author1
  • last author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.CC1
  • cs.GT1
  • cs.IT1
  • physics.hist-ph1
same name
  • T. Okamoto — 68 papers, h 30
  • T. Okamoto — 27 papers, h 22
  • T. Okamoto — 20 papers, h 16
  • T. Okamoto — 11 papers, h 3
  • T. Okamoto — 6 papers, h 16
  • T. Okamoto — 5 papers, h 6

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052023
most citedA Unified Paradigm of Organized Complexity and Semantic Information Theory

6 citations · 10 across the 4 of their papers we have counts for

collaborators

4 papers

physics.hist-ph2023

On the Arrow of Time and Organized Complexity in the Universe

Tatsuaki Okamoto

There is a widespread assumption that the universe in general, and the Earth's biosphere in particular, is becoming more complex over time. This paper formulates this assumption as…

cs.IT2016★ 6 cited

A Unified Paradigm of Organized Complexity and Semantic Information Theory

Tatsuaki Okamoto

One of the most fundamental problems in science is to define {\it quantitatively} the complexity of organized matters, i.e., {\it organized complexity}. Although many measures have…

cs.GT2012★ 3 cited

A Cryptographic Moving-Knife Cake-Cutting Protocol

Yoshifumi Manabe, Tatsuaki Okamoto

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier…

cs.CC2005★ 1 cited

Resource Bounded Unprovability of Computational Lower Bounds

Tatsuaki Okamoto, Ryo Kashima

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.