Space-time complexity in optical computing

1991 ◽  
Vol 2 (4) ◽  
pp. 373-378 ◽  
Author(s):  
H. J. Caulfield
Keyword(s):  
Time Complexity ◽  
Optical Computing ◽  
Space Time

scholarly journals Everything as an Algorithm ~ Computational Analysis and Model for Space/Time Complexity

2021 ◽  
Author(s):  
Andrew Kamal
Keyword(s):  
Subject Matter ◽  
Time Complexity ◽  
Quantum Physics ◽  
Computational Analysis ◽  
Classical Mechanics ◽  
Space Time ◽  
Quantum Similarity ◽  
The Subject ◽  
Origin Point

Utilizing multiple theorems derived from and formulating the equation : Z = {∀Θ ∈ Z → ∃s ∈ P S ∧ ∃t ∈ T : Θ = (s, t)} and formulating the equation: X = O + Ĥ + (n(log)Φ Pd x ), as well as some mathematical constraints and numerous implications in Quantum Physics, Classical Mechanics, and Algorithmic Quantization, we come up with a framework for mathematically representing our universe. These series of individualized papers make up a huge part of a dissertation on the subject matter of Quantum Similarity. Everything including how we view time itself and the origin point for our universe is explained in theoretical details throughout these papers.

Phase-pulling and space-time complexity in an ac driven damped one-dimensional sine-gordon system

1986 ◽  
Vol 119 (6) ◽  
pp. 273-279 ◽  
Author(s):  
A. Mazor ◽  
A.R. Bishop ◽  
D.W. McLaughlin
Keyword(s):  
Time Complexity ◽  
Space Time ◽  
One Dimensional

Generalizations of Checking Stack Automata: Characterizations and Hierarchies

2021 ◽  
pp. 1-28
Author(s):  
Oscar H. Ibarra ◽  
Ian McQuillan
Keyword(s):  
Time Complexity ◽  
Finite Automata ◽  
Space Time ◽  
Turing Machines ◽  
Computing Power ◽  
Multiple Input

We examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines. For various models, we obtain hierarchies in terms of their computing power. Our characterizations and hierarchies expand or tighten some previously known results. We also discuss some decidability questions and the space/time complexity of the models.

Sign in / Sign up

Export Citation Format

Share Document